Skip to main content
SpringerLink
Log in

Isomorphism for Graphs of Bounded Connected-Path-Distance-Width

  • Conference paper
Algorithms and Computation (ISAAC 2012)

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

Included in the following conference series:

Abstract

We show that Graph Isomorphism problem (GI) can be solved in \(\mathcal{O}(n^{2})\) time for graphs of bounded connected-path-distance-width, and more generally, in \(\mathcal{O}(n^{c + 1})\) time for graphs of bounded c-connected-path-distance-width, where n is the number of vertices. These results extend the result of Yamazaki, Bodlaender, de Fluiter, and Thilikos [Isomorphism for graphs of bounded distance width. Algorithmica 24, 105–127 (1999)], who showed the fixed-parameter tractability of GI parameterized by rooted-path-distance-width.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Babai, L., Grigoryev, D., Mount, D.: Isomorphism of graphs with bounded eigenvalue multiplicity. In: 14th Annual ACM Symposium on Theory of Computing (STOC 1982), pp. 310–324 (1982)

    Google Scholar 

  2. Bodlaender, H.L.: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J. Algorithms 11, 631–643 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bodlaender, H.L., Demaine, E.D., Fellows, M.R., Guo, J., Hermelin, D., Lokshtanov, D., Müller, M., Raman, V., van Rooij, J., Rosamond, F.A.: Open problems in parameterized and exact computation — IWPEC 2008. Tech. Rep. UU-CS-2008-017, Department of Information and Computing Sciences, Utrecht University (2008)

    Google Scholar 

  4. Cai, L., Juedes, D.: On the existence of subexponential parameterized algorithms. J. Comput. System Sci. 67, 789–807 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Das, B., Torán, J., Wagner, F.: Restricted space algorithms for isomorphism on bounded treewidth graphs. In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010). LIPIcs, vol. 5, pp. 227–238 (2010)

    Google Scholar 

  6. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1998)

    Google Scholar 

  7. Evdokimov, S., Ponomarenko, I.: Isomorphism of coloured graphs with slowly increasing multiplicity of jordan blocks. Combinatorica 19, 321–333 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Filotti, I.S., Mayer, J.N.: A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. In: 12th Annual ACM Symposium on Theory of Computing (STOC 1980), pp. 236–243 (1980)

    Google Scholar 

  9. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)

    Google Scholar 

  10. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)

    Google Scholar 

  11. Grohe, M., Marx, D.: Structure theorem and isomorphism test for graphs with excluded topological subgraphs. In: 44th Annual ACM Symposium on Theory of Computing (STOC 2012), pp. 173–192 (2012)

    Google Scholar 

  12. Kaplan, H., Shamir, R.: Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques. SIAM J. Comput. 25, 540–561 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kintali, S.: Hardness of graph isomorphism of bounded treewidth graphs, http://kintali.wordpress.com/2011/11/16/

  14. Köbler, J.: On Graph Isomorphism for Restricted Graph Classes. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 241–256. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Köbler, J., Schöning, U., Torán, J.: The Graph Isomorphism Problem: Its Structural Complexity. Birkhauser Verlag (1993)

    Google Scholar 

  16. Kratsch, S., Schweitzer, P.: Isomorphism for Graphs of Bounded Feedback Vertex Set Number. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 81–92. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. System Sci. 25, 42–65 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  18. Miller, G.: Isomorphism testing for graphs of bounded genus. In: 12th Annual ACM Symposium on Theory of Computing (STOC 1980), pp. 225–235 (1980)

    Google Scholar 

  19. Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press (2006)

    Google Scholar 

  20. Otachi, Y., Saitoh, T., Yamanaka, K., Kijima, S., Okamoto, Y., Ono, H., Uno, Y., Yamazaki, K.: Approximability of the Path-Distance-Width for AT-free Graphs. In: Kolman, P., Kratochvíl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 271–282. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  21. Read, R.C., Corneil, D.G.: The graph isomorphism disease. J. Graph Theory 1, 339–363 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  22. Schöning, U.: Graph isomorphism is in the low hierarchy. J. Comput. System Sci. 37, 312–323 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  23. Yamazaki, K.: On approximation intractability of the path-distance-width problem. Discrete Appl. Math. 110, 317–325 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  24. Yamazaki, K., Bodlaender, H.L., de Fluiter, B., Thilikos, D.M.: Isomorphism for graphs of bounded distance width. Algorithmica 24, 105–127 (1999)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science, Japan Advanced Institute of Science and Technology, Asahidai 1-1, Nomi, Ishikawa, 923-1292, Japan

    Yota Otachi

Authors
  1. Yota Otachi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Information Engineering, National Taiwan University, 1 Roosevelt Road, Section 4, 106, Taipei, Taiwan

    Kun-Mao Chao

  2. Institute of Information Science, Academia Sinica, 128 Academia Road, Section 2, 115, Taipei, Taiwan

    Tsan-sheng Hsu

  3. Department of Computer Science and Engineering, National Chung Hsing University, 250 Kuo Kuang Road, 402, Taichung, Taiwan

    Der-Tsai Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Otachi, Y. (2012). Isomorphism for Graphs of Bounded Connected-Path-Distance-Width. In: Chao, KM., Hsu, Ts., Lee, DT. (eds) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol 7676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35261-4_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35261-4_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35260-7

  • Online ISBN: 978-3-642-35261-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation