skip to main content
research-article

Canonizing Graphs of Bounded Tree Width in Logspace

Published:04 October 2017Publication History
Skip Abstract Section

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.

References

  1. Vikraman Arvind, Bireswar Das, and Johannes Köbler. 2008. A logspace algorithm for partial 2-tree canonization. In Proceedings of the 3rd International Computer Science Symposium in Russia (CSR’08) (Lecture Notes in Computer Science). Springer, 40--51. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Vikraman Arvind, Bireswar Das, Johannes Köbler, and Sebastian Kuhnert. 2012. The isomorphism problem for -trees is complete for logspace. Info. Comput. 217 (2012), 1--11. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. László Babai. 2016. Graph isomorphism in quasipolynomial time {extended abstract}. In Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC’16). ACM, 684--697. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Hans L. Bodlaender. 1990. Polynomial algorithms for graph isomorphism and chromatic index on partial -trees. J. Algor. 11, 4 (1990), 631--643. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. R. B. Boppana, J. Hastad, and S. Zachos. 1987. Does have short interactive proofs? Inf. Process. Lett. 25, 2 (May 1987), 127--132. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Bireswar Das, MuraliKrishna Enduri, and I. Vinod Reddy. 2015. Logspace and algorithms for graph isomorphism for subclasses of bounded tree-width graphs. In Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM’15) (Lecture Notes in Computer Science), Vol. 8973. Springer, 329--334.Google ScholarGoogle Scholar
  7. Bireswar Das, Jacobo Torán, and Fabian Wagner. 2012. Restricted space algorithms for isomorphism on bounded treewidth graphs. Info. Comput. 217 (2012), 71--83. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, and Fabian Wagner. 2009a. Planar graph isomorphism is in log-space. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC’09). IEEE Computer Society, 203--214. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Samir Datta, Prajakta Nimbhorka, Thomas Thierauf, and Fabian Wagner. 2009b. Graph isomorphism for -free and -free graphs is in log-space. In Proceedings of the 29th Annual IARCS Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’09) (Leibniz International Proceedings in Informatics), Vol. 4. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 145--156.Google ScholarGoogle Scholar
  10. Reinhard Diestel. 2005. Graph Theory (3rd ed.). Graduate Texts in Mathematics, Vol. 173. Springer.Google ScholarGoogle Scholar
  11. Michael Elberfeld, Andreas Jakoby, and Till Tantau. 2010. Logspace versions of the theorems of Bodlaender and Courcelle. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS’10). IEEE Computer Society, 143--152. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Michael Elberfeld and Ken-ichi Kawarabayashi. 2014. Embedding and canonizing graphs of bounded genus in logspace. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC’14). ACM, New York, NY, 383--392. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Michael Elberfeld and Pascal Schweitzer. 2016. Canonizing graphs of bounded tree width in logspace. In Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science (STACS’16) (Leibniz International Proceedings in Informatics), Vol. 47. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 32:1--32:14.Google ScholarGoogle Scholar
  14. Ion S. Filotti and Jack N. Mayer. 1980. A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC’80). ACM, New York, NY, 236--243. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Martin Grohe. 2000. Isomorphism testing for embeddable graphs through definability. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC’00). ACM, 63--72. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Martin Grohe. 2012. Fixed-point definability and polynomial time on graphs with excluded minors. J. ACM 59, 5 (2012), 27. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Martin Grohe, Ken-ichi Kawarabayashi, and Bruce A. Reed. 2013. A simple algorithm for the graph minor decomposition—Logic meets structural graph theory. In Proceedings of the 23rd Annual ACM/SIAM Symposium on Discrete Algorithms (SODA’12). SIAM, 414--431. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Martin Grohe and Oleg Verbitsky. 2006. Testing graph isomorphism in parallel by playing a game. In Proceedings of 33rd International Colloquium on Automata, Languages and Programming (ICALP’06) (Lecture Notes in Computer Science), Vol. 4051. Springer, 3--14. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. E. Hopcroft and J. K. Wong. 1974. Linear time algorithm for isomorphism of planar graphs (preliminary report). In Proceedings of the 6th Annual ACM Symposium on Theory of Computing (STOC’74). ACM, New York, NY, 172--184. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Birgit Jenner, Johannes Köbler, Pierre McKenzie, and Jacobo Torán. 2003. Completeness results for graph isomorphism. J. Comput. Syst. Sci. 66, 3 (2003), 549--566. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Neil D. Jones. 1975. Space-bounded reducibility among combinatorial problems. J. Comput. Syst. Sci. 11, 1 (1975), 68--85. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Richard E. Ladner and Nancy A. Lynch. 1976. Relativization of questions about log space computability. Theory Comput. Syst. 10 (1976), 19--32. Issue 1.Google ScholarGoogle Scholar
  23. Hanns-Georg Leimer. 1993. Optimal decomposition by clique separators. Discrete Math. 113, 13 (1993), 99--123. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Steven Lindell. 1992. A logspace algorithm for tree canonization (extended abstract). In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC’92). ACM, New York, NY, 400--404. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. 2014a. Fixed-parameter tractable canonization and isomorphism test for graphs of bounded tree width. In Proceedings of the 55th IEEE Symposium on Foundations of Computer Science (FOCS’14). IEEE Computer Society, 186--195. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. 2014b. Fixed-parameter tractable canonization and isomorphism test for graphs of bounded tree width. CoRR abs/1404.0818 (2014).Google ScholarGoogle Scholar
  27. Gary L. Miller. 1980. Isomorphism testing for graphs of bounded genus. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC’80). ACM, New York, NY, 225--235. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Yota Otachi and Pascal Schweitzer. 2014. Reduction techniques for graph isomorphism in the context of width parameters. In Proceedings of the 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’14) (Lecture Notes in Computer Science), Vol. 8503. Springer, 368--379.Google ScholarGoogle ScholarCross RefCross Ref
  29. I. N. Ponomarenko. 1991. The isomorphism problem for classes of graphs closed under contraction. J. Math. Sci. 55, 2 (1991), 1621--1643.Google ScholarGoogle ScholarCross RefCross Ref
  30. Omer Reingold. 2008. Undirected connectivity in log-space. J. ACM 55, 4 (2008), 1--24. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Uwe Schöning. 1988. Graph isomorphism is in the low hierarchy. J. Comput. Syst. Sci. 37, 3 (1988), 312--323. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. L. J. Stockmeyer and A. R. Meyer. 1973. Word problems requiring exponential time (preliminary report). In Proceedings of the 5th Annual ACM Symposium on Theory of Computing (STOC’73). ACM, 1--9. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Robert Endre Tarjan. 1971. A V2 algorithm for determining isomorphism of planar graphs. Inform. Process. Lett. 1, 1 (1971), 32--34. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Jacobo Torán. 2004. On the hardness of graph isomorphism. SIAM J. Comput. 33, 5 (2004), 1093--1108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Heribert Vollmer. 1999. Introduction to Circuit Complexity: A Uniform Approach. Springer, Berlin. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Fabian Wagner. 2011. Graphs of bounded tree width can be canonized in AC1. In Proceedings of the 6th International Computer Science Symposium in Russia (CSR’11) (Lecture Notes in Computer Science). Springer, 209--222. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Canonizing Graphs of Bounded Tree Width in Logspace

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!