Skip to main content
Springer Nature Link
Log in

Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space

  • Conference paper
Fundamentals of Computation Theory (FCT 2009)

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

Included in the following conference series:

  • 484 Accesses

Abstract

We show that the reachability problem for directed graphs that are either K 3,3-free or K 5-free is in unambiguous log-space, UL ∩ coUL. This significantly extends the result of Bourke, Tewari, and Vinodchandran that the reachability problem for directed planar graphs is in UL ∩ coUL.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Allender, E., Datta, S., Roy, S.: The directed planar reachability problem. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 238–249. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Asano, T.: An approach to the subgraph homeomorphism problem. Theoretical Computer Science 38 (1985)

    Google Scholar 

  3. Bourke, C., Tewari, R., Vinodchandran, N.: Directed planar reachability is in unambiguous log-space. In: Annual IEEE Conference on Computational Complexity (CCC), pp. 217–221 (2007)

    Google Scholar 

  4. Datta, S., Limaye, N., Nimbhorkar, P., Thierauf, T., Wagner, F.: Planar graph isomorphism is in log-space. Technical report, arXiv:0809.2319v2 (2009)

    Google Scholar 

  5. Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM Journal on Computing 2(3), 135–158 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  6. Khuller, S.: Parallel algorithms for K 5-minor free graphs. Technical Report TR88-909, Cornell University, Computer Science Department (1988)

    Google Scholar 

  7. Limaye, N., Mahajan, M., Nimbhorkar, P.: Longest paths in planar dags in unambiguous logspace. In: Computing: The Australian Theory Symposium (CATS), vol. 94 (2009)

    Google Scholar 

  8. Reingold, O.: Undirected st-connectivity in log-space. In: Proceedings of the 37th annual ACM Symposium on Theory of Computing (STOC), pp. 376–385 (2005)

    Google Scholar 

  9. Reinhardt, K., Allender, E.: Making nondeterminism unambiguous. SIAM Journal of Computing 29(4), 1118–1131 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Thierauf, T., Wagner, F.: The isomorphism problem for planar 3-connected graphs is in unambiguous logspace. In: Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 633–644 (2008)

    Google Scholar 

  11. Tutte, W.T.: Connectivity in graphs. University of Toronto Press (1966)

    Google Scholar 

  12. Vazirani, V.V.: NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems. Information and Computation 80 (1989)

    Google Scholar 

  13. Wagner, K.: Über eine Eigenschaft der ebenen Komplexe. In: Mathematical Annalen, vol. 114 (1937)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fak. Elektronik und Informatik, HTW Aalen, 73430, Aalen, Germany

    Thomas Thierauf

  2. Inst. für Theoretische Informatik, Universität Ulm, 89069, Ulm, Germany

    Fabian Wagner

Authors
  1. Thomas Thierauf
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabian Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Wrocław University of Technology, ul. Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland

    Mirosław Kutyłowski  & Maciej Gębala  & 

  2. Institute of Computer Science, University of Wrocław, ul. Joliot-Curie 15, 50-383, Wrocław, Poland

    Witold Charatonik

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thierauf, T., Wagner, F. (2009). Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds) Fundamentals of Computation Theory. FCT 2009. Lecture Notes in Computer Science, vol 5699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03409-1_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03409-1_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03408-4

  • Online ISBN: 978-3-642-03409-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics