Maintenance Of Transitive Closures And Transitive Reductions Of Graphs (1987)
by
J.A. La Poutré
,
J. van Leeuwen
,
J. A. La
,
Poutr J. Leeuwen
,
Vakgroep Informatica
| Citations: | 34 - 0 self |
BibTeX
@MISC{Poutré87maintenanceof,
author = {J.A. La Poutré and J. van Leeuwen and J. A. La and Poutr J. Leeuwen and Vakgroep Informatica},
title = {Maintenance Of Transitive Closures And Transitive Reductions Of Graphs},
year = {1987}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper appeared in the Proceedings of the 13th lat. Workshop on "Graph-Theoretic Concepts in Computer Science" (WG '87), June 29 July 1, 1987, Kloster Banz/Staffelstein (FIG), published as: Lecture Notes in Computer Science, Vol. 314, Springer-Verlag, Berlin, 1988, pp. 106 - 120
Citations
| 801 | Depth-first search and linear graph algorithms - Tarjan - 1972 |
| 132 | The transitive reduction of a directed graph - Aho - 1972 |
| 30 | On-line computation of transitive closure graphs - Ibaraki, Katoh - 1983 |
| 1 | ohnert, A dynami=.ation of the all pairs least cost path problem - P - 1985 |
