Skip to main content
SpringerLink
Log in

On shortcutting digraphs

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 657))

Included in the following conference series:

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chartrand, G., and Lesniak, L.: Graphs & Digraphs, 2nd edition. Wadsworth & Brooks / Cole Advanced Books & Software, California, 1986.

    Google Scholar 

  2. Chazelle, B.: Computing on a Free Tree via Complexity Preserving Mappings. Algorithmica 2 (1987) 337–361.

    Google Scholar 

  3. Thorup, M.: Shortcutting Planar Digraphs. Technical Report PRG-TR-4-92, Programming Research Group of Oxford University, 1992.

    Google Scholar 

  4. Vishkin, U.: Private communication, 1991.

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Programming Research Group, University of Oxford, 8-11 Keble Road, OX1 3QD, Oxford, England

    Mikkel Thorup

Authors
  1. Mikkel Thorup
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ernst W. Mayr

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation