Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier

Authors:
C. Demetrescu;G. F. Italiano
Affiliations:
-;-
Venue:
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Year:
2000

Citing 0
Cited 38

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Journal of the ACM (JACM)
Dynamic subgraph connectivity with geometric applications

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A faster and simpler fully dynamic transitive closure

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Exact and Approximate Distances in Graphs - A Survey

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Combinatorial algorithms for feedback problems in directed graphs

Information Processing Letters
Implementations and experimental studies of dynamic graph algorithms

Experimental algorithmics
An Experimental Study of Dynamic Algorithms for Transitive Closure

Journal of Experimental Algorithmics (JEA)
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A fully dynamic reachability algorithm for directed graphs with an almost linear update time

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Worst-case update times for fully-dynamic all-pairs shortest paths

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fast sparse matrix multiplication

ACM Transactions on Algorithms (TALG)
Fully dynamic all pairs shortest paths with real edge weights

Journal of Computer and System Sciences - Special issue on FOCS 2001
A dynamic topological sort algorithm for directed acyclic graphs

Journal of Experimental Algorithmics (JEA)
Managing RBAC states with transitive relations

ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths

Journal of Algorithms
A faster and simpler fully dynamic transitive closure

ACM Transactions on Algorithms (TALG)
An experimental study of algorithms for fully dynamic transitive closure

Journal of Experimental Algorithmics (JEA)
Algebraic Graph Algorithms

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
An Approximation Algorithm for the Minimum Breakpoint Linearization Problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Maintaining dynamic minimum spanning trees: An experimental study

Discrete Applied Mathematics
Dynamic plane transitive closure

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms

Proceedings of the forty-second ACM symposium on Theory of computing
Dynamic graph algorithms

Algorithms and theory of computation handbook
GRAIL: scalable reachability index for large graphs

Proceedings of the VLDB Endowment
Labeling recursive workflow executions on-the-fly

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Knuth-Bendix completion as a data structure

RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Using dominators for solving constrained path problems

PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
An experimental study of algorithms for fully dynamic transitive closure

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Improved deterministic algorithms for decremental transitive closure and strongly connected components

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Banshee: a scalable constraint-based analysis toolkit

SAS'05 Proceedings of the 12th international conference on Static Analysis
Decremental clique problem

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Labeling workflow views with fine-grained dependencies

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

For any positive integers r and n, let H(r,n) denote the family of graphs on n vertices with maximum degree r, and let H(r,n,n) denote the family of bipartite graphs H on 2n vertices with n vertices in each vertex class, and with maximum degree r. On ...