{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:24Z","timestamp":1725455424835},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016274","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"484-492","source":"Crossref","is-referenced-by-count":1,"title":["The space complexity of the accessibility problem for undirected graphs of log n bounded genus"],"prefix":"10.1007","author":[{"given":"K.","family":"Kriegel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1109\/SFCS.1979.34"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"I. S. Filotti, J. N. Mayer, \"A polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus\", 12th STOC, 1980","DOI":"10.1145\/800141.804671"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"J. R. Gilbert, J. P. Hutchinson, R. E. Tarjan, \"A Separator Theorem for Graphs of Bounded Genus\", J. of Algorithms 5,1984","DOI":"10.1016\/0196-6774(84)90019-1"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"J. Ja'Ja',J. Simon, \"Space Efficient Algorithms for Some Graph Theoretical Problems\", Acta Informatica 17, 1982","DOI":"10.1007\/BF00264160"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"W. Savitch, \"Relationships Between Nondeterministic and Deterministic Space Complexities\", JCSS 4, 1970","DOI":"10.1016\/S0022-0000(70)80006-X"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"S. Stahl, \"The Embeddings of a Graph \u2014 A Survey\", J. of Graph Theory, Vol. 2, 1978","DOI":"10.1002\/jgt.3190020402"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016274.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:35:56Z","timestamp":1607549756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0016274","relation":{},"subject":[]}}