The space complexity of the accessibility problem for undirected graphs of log n bounded genus

  • K. Kriegel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 233)


We present an algorithm solving the accessibility problem and the connectivity problem for undirected n-vertex graphs of genus ≤ log n in 0(log2n/log log n) space. This improves the known upper bound by the factor log log n and shows an alternative to Savitchs devide and conquer method.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A,K,L,L,R]
    R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovasz, C. Rackoff, "Random Walks, Universal Traversal Sequences and the Complexity of Maze Problems", 20th FOCS, 1979Google Scholar
  2. [F,M]
    I. S. Filotti, J. N. Mayer, "A polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus", 12th STOC, 1980Google Scholar
  3. [G,H,T]
    J. R. Gilbert, J. P. Hutchinson, R. E. Tarjan, "A Separator Theorem for Graphs of Bounded Genus", J. of Algorithms 5,1984Google Scholar
  4. [J,S]
    J. Ja'Ja',J. Simon, "Space Efficient Algorithms for Some Graph Theoretical Problems", Acta Informatica 17, 1982Google Scholar
  5. [S]
    W. Savitch, "Relationships Between Nondeterministic and Deterministic Space Complexities", JCSS 4, 1970Google Scholar
  6. [St]
    S. Stahl, "The Embeddings of a Graph — A Survey", J. of Graph Theory, Vol. 2, 1978Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • K. Kriegel
    • 1
  1. 1.Karl-Weierstraß-Institut für Mathematik der Akademie der Wissenschaften der DDRBerlin

Personalised recommendations