MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

A Fully Dynamic Algorithm for Maintaining the Transitive Closure (1999) [26 citations — 1 self]

by Valerie King ,  Garry Sagert
In Proc. 31st ACM Symposium on Theory of Computing (STOC'99
Add To MetaCart

Abstract:

This paper presents an efficient fully dynamic graph algorithm for maintaining

Citations

6121 Introduction to Algorithms – Cormen, Leiserson, et al. - 2001
538 Matrix multiplication via arithmetic progressions – Coppersmith, Winograd - 1990
233 Gaussian elimination is not optimal – Strassen - 1969
97 The Design and Analysis of Algorithms – Kozen - 1990
90 Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity – Holm, Lichtenberg, et al. - 2001
64 Size-estimation framework with applications to transitive closure and reachability – Cohen - 1997
56 Fast rectangular matrix multiplications and applications – Huang, Pan - 1998
43 Fully dynamic biconnectivity and transitive closure – Henzinger, King - 1995
30 On-line computation of transitive closure graphs – Ibaraki, Katoh - 1983
30 Amortized efficiency of a path retrieval data structure – Italiano
29 Finding paths and deleting edges in directed acyclic graphs – Italiano - 1988
24 An on-line edge-deletion problem – Even, Shiloach - 1981
23 Speeding up dynamic transitive closure for bounded degree graphs – Yellin - 1993
9 Dynamic graph algorithms – Feigenbaum, Kannan - 1995
6 Tarjan� Data Structures and Network Algo� rithms – E - 1983
5 Sampling to provide or to bound: With applictions to fully dynamic graph algorithms. Random Structures and Algorithms – Henzinger, Thorup - 1997
2 Henzinger, "Lower Bounds for Fully Dynamic Connectivity Problems in Graphs", Algorithmica 22 – Fredman, Rauch - 1998
2 Fully Dynamic Biconnectivity and Transtive Closure – Henzinger, King - 1995
2 Leeuwen, "Maintenance of transitive closure and transitive reduction of graphs – Poutr'e, van - 1987
2 Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Structures and Algorithms 11, 369--379. See also ICALP'96 – Henzinger, Thorup - 1997
1 Graph Certificates and Lookahead in Dynamic Directed Graph Problems, with Applications – Khanna, Motwani, et al. - 1996
View or Download | Add to My Collection | Correct Errors