Research on parameterized graph algorithms

我们已经开发了固定参数的算法或证明的硬度的顶点着色问题的参数化图，通过添加或删除边的图类，如可比图，置换图和网格图。我们还发展了树+ ke图同构的固定参数算法。此外，我们还阐明了问题和参数化图类的性质，这使得设计固定参数算法成为可能。

We have developed fixed-parameter algorithms or proved the hardness of vertex coloring problems on parameterized graphs obtained by adding or deleting edges from graphs in classes such as comparability graphs, permutation graphs and grid graphs. We have also developed a fixed-parameter algorithm for isomorphism of tree+ ke graphs. In addition, we have clarified the property of problems and parameterized graph classes which makes it possible to design fixed-parameter algorithms.