Skip to main content
SpringerLink
Log in

Maintenance of transitive closures and transitive reductions of graphs

  • Graphs, Geometry And Data Structures
  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1987)

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

Included in the following conference series:

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. A.V. Aho, M.R. Garey and J.D. Ullman, The transitive reduction of a directed graph, SIAM Journal of Computing, vol. 1, no. 2 (June 1972) 131–137.

    Article  Google Scholar 

  2. T. Ibaraki and N. Katoh, On-line computation of transitive closures of graphs, Information Processing Letters 16 (1983) 95–97.

    Article  Google Scholar 

  3. J.A. La Poutré and J. van Leeuwen, Maintenance of transitive closures and transitive reductions of graphs, Technical Report RUU-CS-87-25, Dept. of Computer Science, University of Utrecht.

    Google Scholar 

  4. J.A. La Poutré and J. van Leeuwen, in preparation.

    Google Scholar 

  5. H. Rohnert, A dynamization of the all pairs least cost path problem, Lecture Notes in Computer Science 182 (1985) 279–286.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Utrecht, P.O. Box 80.012, 3508 TA, Utrecht, The Netherlands

    J. A. La Poutré & J. van Leeuwen

Authors
  1. J. A. La Poutré
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. van Leeuwen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Herbert Göttler Hana-Jürgen Schneider

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

La Poutré, J.A., van Leeuwen, J. (1988). Maintenance of transitive closures and transitive reductions of graphs. In: Göttler, H., Schneider, HJ. (eds) Graph-Theoretic Concepts in Computer Science. WG 1987. Lecture Notes in Computer Science, vol 314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19422-3_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-19422-3_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19422-4

  • Online ISBN: 978-3-540-39264-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation