Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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, 1979
I. S. Filotti, J. N. Mayer, "A polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus", 12th STOC, 1980
J. R. Gilbert, J. P. Hutchinson, R. E. Tarjan, "A Separator Theorem for Graphs of Bounded Genus", J. of Algorithms 5,1984
J. Ja'Ja',J. Simon, "Space Efficient Algorithms for Some Graph Theoretical Problems", Acta Informatica 17, 1982
W. Savitch, "Relationships Between Nondeterministic and Deterministic Space Complexities", JCSS 4, 1970
S. Stahl, "The Embeddings of a Graph — A Survey", J. of Graph Theory, Vol. 2, 1978
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kriegel, K. (1986). The space complexity of the accessibility problem for undirected graphs of log n bounded genus. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016274
Download citation
DOI: https://doi.org/10.1007/BFb0016274
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive