On shortcutting digraphs

  • Mikkel Thorup
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 657)


A conjecture about digraphs is presented. The conjecture has relevance to parallel computing, and is supported by a few concrete results.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chartrand, G., and Lesniak, L.: Graphs & Digraphs, 2nd edition. Wadsworth & Brooks / Cole Advanced Books & Software, California, 1986.Google Scholar
  2. 2.
    Chazelle, B.: Computing on a Free Tree via Complexity Preserving Mappings. Algorithmica 2 (1987) 337–361.Google Scholar
  3. 3.
    Thorup, M.: Shortcutting Planar Digraphs. Technical Report PRG-TR-4-92, Programming Research Group of Oxford University, 1992.Google Scholar
  4. 4.
    Vishkin, U.: Private communication, 1991.Google Scholar
  5. 5.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Mikkel Thorup
    • 1
  1. 1.Programming Research GroupUniversity of OxfordOxfordEngland

Personalised recommendations