Skip to main content
SpringerLink
Log in

The Isomorphism Problem for k-Trees Is Complete for Logspace

  • Conference paper
Mathematical Foundations of Computer Science 2009 (MFCS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5734))

Abstract

We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound and matches the lower bound. As a consequence, the isomorphism, the automorphism, as well as the canonization problem for k-trees are all complete for deterministic logspace. We also show that even simple structural properties of k-trees are complete for logspace.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arvind, V., Das, B., Köbler, J.: The space complexity of k-tree isomorphism. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 822–833. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Arvind, V., Das, B., Köbler, J.: A logspace algorithm for partial 2-tree canonization. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) Computer Science – Theory and Applications. LNCS, vol. 5010, pp. 40–51. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Aho, A., Hopcroft, J., Ullman, J.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1974)

    MATH  Google Scholar 

  4. Àlvarez, C., Jenner, B.: A very hard log-space counting class. Theoretical Computer Science 107(1), 3–30 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  5. Arvind, V., Kurur, P.P.: Graph isomorphism is in SPP. Information and Computation 204(5), 835–852 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Allender, E., Mahajan, M.: The complexity of planarity testing. Information and Computation 139(1) (February 2004)

    Google Scholar 

  7. Buntrock, G., Damm, C., Hertrampf, U., Meinel, C.: Structure and importance of logspace-MOD classes. Mathematical Systems Theory 25, 223–237 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cook, S.A.: A taxonomy of problems with fast parallel algorithms. Information and Control 64, 2–22 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  9. Datta, S., Limaye, N., Nimbhorkar, P., Thierauf, T., Wagner, F.: A log-space algorithm for canonization of planar graphs. CoRR (2008), http://arxiv.org/abs/0809.2319

  10. Etessami, K.: Counting quantifiers, successor relations, and logarithmic space. Journal of Computer and System Sciences 54(3), 400–411 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: Randomness and Computation. Advances in Computing Research, vol. 5, pp. 73–90. JAI Press (1989)

    Google Scholar 

  12. Del Greco, J.G., Sekharan, C.N., Sridhar, R.: Fast parallel reordering and isomorphism testing of k-trees. Algorithmica 32(1), 61–72 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hoffmann, C.M.: Group-Theoretic Algorithms and Graph Isomorphism. LNCS, vol. 136. Springer, Heidelberg (1982)

    MATH  Google Scholar 

  14. Jenner, B., Köbler, J., McKenzie, P., Torán, J.: Completeness results for graph isomorphism. Journal of Computer and System Sciences 66, 549–566 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Klawe, M.M., Corneil, D.G., Proskurowski, A.: Isomorphism testing in hookup classes. SIAM Journal on Algebraic and Discrete Methods 3(2), 260–274 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  16. Köbler, J., Schöning, U., Torán, J.: The Graph Isomorphism Problem: Its Structural Complexity. Progress in Theoretical Computer Science. Birkhäuser, Boston (1993)

    Google Scholar 

  17. Lindell, S.: A logspace algorithm for tree canonization. extended abstract. In: Proceedings of the 24th STOC, pp. 400–404. ACM, New York (1992)

    Google Scholar 

  18. Miller, G., Reif, J.: Parallel tree contraction part 2: further applications. SIAM Journal on Computing 20, 1128–1147 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  19. Reingold, O.: Undirected st-connectivity in log-space. In: Proceedings of the 37th STOC, pp. 376–385. ACM, New York (2005)

    Google Scholar 

  20. Schöning, U.: Graph isomorphism is in the low hierarchy. Journal of Computer and System Sciences 37, 312–323 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  21. Torán, J.: On the hardness of graph isomorphism. SIAM Journal on Computing 33(5), 1093–1108 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Humboldt Universität zu Berlin, Germany

    Johannes Köbler & Sebastian Kuhnert

Authors
  1. Johannes Köbler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sebastian Kuhnert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Research partially funded by grant APVV 0433-06, Bratislava, Slovakia

    Rastislav Královič

  2. Members of EACSL Jury for the Ackermann Award, Poland

    Damian Niwiński

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Köbler, J., Kuhnert, S. (2009). The Isomorphism Problem for k-Trees Is Complete for Logspace. In: Královič, R., Niwiński, D. (eds) Mathematical Foundations of Computer Science 2009. MFCS 2009. Lecture Notes in Computer Science, vol 5734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03816-7_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03816-7_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03815-0

  • Online ISBN: 978-3-642-03816-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation