This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Aho, J. Hopcroft, J. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley (1974).
A. Schonhage, Storage modification machines, SIAM on Comp., (1980).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag
About this paper
Cite this paper
Rytter, W. (1983). A note on the complexity of traversing a labyrinth. In: Borowiecki, M., Kennedy, J.W., Sysło, M.M. (eds) Graph Theory. Lecture Notes in Mathematics, vol 1018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071632
Download citation
DOI: https://doi.org/10.1007/BFb0071632
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12687-4
Online ISBN: 978-3-540-38679-7
eBook Packages: Springer Book Archive