Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
Journal of Algorithms
Spanning trees with many leaves
SIAM Journal on Discrete Mathematics
Parallel algorithms for sparse linear systems
SIAM Review
A logspace algorithm for tree canonization (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree
Journal of Algorithms
Isomorphism testing for graphs of bounded genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Tree-depth, subgraph coloring and homomorphism bounds
European Journal of Combinatorics
Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size
IEICE - Transactions on Information and Systems
Polynomial-time algorithms for permutation groups
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
Theory of Computing Systems - Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi
On Digraph Width Measures in Parameterized Algorithmics
Parameterized and Exact Computation
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Forbidden graphs for tree-depth
European Journal of Combinatorics
Isomorphism for graphs of bounded feedback vertex set number
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Structure theorem and isomorphism test for graphs with excluded topological subgraphs
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Sparsity: Graphs, Structures, and Algorithms
Sparsity: Graphs, Structures, and Algorithms
Where First-Order and Monadic Second-Order Logic Coincide
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The fixed-parameter tractability of graph isomorphism is an open problem with respect to a number of natural parameters, such as tree-width, genus and maximum degree. We show that graph isomorphism is fixed-parameter tractable when parameterized by the tree-depth of the graph. We also extend this result to a parameter generalizing both tree-depth and max-leaf-number by deploying new variants of cops-and-robbers games.