Abstract
A conjecture about digraphs is presented. The conjecture has relevance to parallel computing, and is supported by a few concrete results.
Supported by a NATO grant from the Danish Technical Research Council, and by the Danish Research Academy
Preview
Unable to display preview. Download preview PDF.
References
Chartrand, G., and Lesniak, L.: Graphs & Digraphs, 2nd edition. Wadsworth & Brooks / Cole Advanced Books & Software, California, 1986.
Chazelle, B.: Computing on a Free Tree via Complexity Preserving Mappings. Algorithmica 2 (1987) 337–361.
Thorup, M.: Shortcutting Planar Digraphs. Technical Report PRG-TR-4-92, Programming Research Group of Oxford University, 1992.
Vishkin, U.: Private communication, 1991.
Yao, A.C.: Space-Time Tradeoff for Answering Range Queries. In: Proceedings of The 14th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1982, pp. 128–136.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thorup, M. (1993). On shortcutting digraphs. In: Mayr, E.W. (eds) Graph-Theoretic Concepts in Computer Science. WG 1992. Lecture Notes in Computer Science, vol 657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56402-0_48
Download citation
DOI: https://doi.org/10.1007/3-540-56402-0_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56402-7
Online ISBN: 978-3-540-47554-5
eBook Packages: Springer Book Archive