Advertisement

Maintenance of transitive closures and transitive reductions of graphs

  • J. A. La Poutré
  • J. van Leeuwen
Graphs, Geometry And Data Structures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 314)

Keywords

Directed Graph Transitive Closure Input Matrix Blue Node Edge Deletion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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.CrossRefGoogle Scholar
  2. [2]
    T. Ibaraki and N. Katoh, On-line computation of transitive closures of graphs, Information Processing Letters 16 (1983) 95–97.CrossRefGoogle Scholar
  3. [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. [4]
    J.A. La Poutré and J. van Leeuwen, in preparation.Google Scholar
  5. [5]
    H. Rohnert, A dynamization of the all pairs least cost path problem, Lecture Notes in Computer Science 182 (1985) 279–286.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • J. A. La Poutré
    • 1
  • J. van Leeuwen
    • 1
  1. 1.Department of Computer ScienceUniversity of UtrechtUtrechtThe Netherlands

Personalised recommendations