Affiliation:
1. RWTH Aachen University, Aachen, Germany
Abstract
Graph canonization is the problem of computing a unique representative, a canon, from the isomorphism class of a given graph. This implies that two graphs are isomorphic exactly if their canons are equal. We show that graphs of bounded tree width can be canonized by logarithmic-space (logspace) algorithms. This implies that the isomorphism problem for graphs of bounded tree width can be decided in logspace. In the light of isomorphism for trees being hard for the complexity class logspace, this makes the ubiquitous class of graphs of bounded tree width one of the few classes of graphs for which the complexity of the isomorphism problem has been exactly determined.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Count-free Weisfeiler–Leman and group isomorphism;International Journal of Algebra and Computation;2024-04-03
2. Shotgun Threshold for Sparse Erdős–Rényi Graphs;IEEE Transactions on Information Theory;2023-11
3. On the Parallel Complexity of Group Isomorphism via Weisfeiler–Leman;Fundamentals of Computation Theory;2023
4. Planar Graph Isomorphism Is in Log-Space;ACM Transactions on Computation Theory;2022-06-30
5. Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09