Part of the Lecture Notes in Computer Science book series (LNCS, volume 314)
Maintenance of transitive closures and transitive reductions of graphs
KeywordsDirected 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.
Unable to display preview. Download preview PDF.
- 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
- J.A. La Poutré and J. van Leeuwen, in preparation.Google Scholar
- H. Rohnert, A dynamization of the all pairs least cost path problem, Lecture Notes in Computer Science 182 (1985) 279–286.Google Scholar
© Springer-Verlag Berlin Heidelberg 1988