Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Amortized efficiency of a path retrieval data structure
Theoretical Computer Science
Finding paths and deleting edges in directed acyclic graphs
Information Processing Letters
An improved algorithm for transitive closure on acyclic digraphs
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Maintenance of transitive closures and transitive reductions of graphs
Proceedings of the International Workshop WG '87 on Graph-theoretic concepts in computer science
A data structure for dynamic trees
Journal of Computer and System Sciences
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
Incremental algorithms for minimal length paths
Journal of Algorithms
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
Complexity models for incremental computation
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the computational complexity of dynamic graph problems
Theoretical Computer Science
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
An empirical study of dynamic graph algorithms
Journal of Experimental Algorithmics (JEA)
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A uniform approach to semi-dynamic problems on digraphs
Theoretical Computer Science - Special issue: graph theoretic concepts in computer science
Sampling to provide or to bound: with applications to fully dynamic graph algorithms
Proceedings of the workshop on Randomized algorithms and computation
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
A fully dynamic algorithm for maintaining the transitive closure
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On certificates and lookahead in dynamic graph problems
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Decremental dynamic connectivity
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of dynamic minimum spanning tree algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Near-optimal fully-dynamic graph connectivity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Fully dynamic algorithms for maintaining shortest paths trees
Journal of Algorithms
Stocastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Maintaining Minimum Spanning Trees in Dynamic Graphs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
A Dynamization of the All Pairs Least Cost Path Problem
STACS '85 Proceedings of the 2nd Symposium of Theoretical Aspects of Computer Science
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
On Incremental Computation of Transitive Closure and Greedy Alignment
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Fully dynamic biconnectivity and transitive closure
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
An Experimental Study of Dynamic Algorithms for Transitive Closure
Journal of Experimental Algorithmics (JEA)
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
Single backup table schemes for shortest-path routing
Theoretical Computer Science - Foundations of software science and computation structures
An experimental study of algorithms for fully dynamic transitive closure
Journal of Experimental Algorithmics (JEA)
Journal of Experimental Algorithmics (JEA)
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Static Network Reliability Estimation via Generalized Splitting
INFORMS Journal on Computing
Hi-index | 0.00 |
Dynamic graph algorithms have been extensively studied in the last two decades due to their wide applicability in many contexts. Recently, several implementations and experimental studies have been conducted investigating the practical merits of fundamental techniques and algorithms. In most cases, these algorithms required sophisticated engineering and fine-tuning to be turned into efficient implementations. In this paper, we survey several implementations along with their experimental studies for dynamic problems on undirected and directed graphs. The former case includes dynamic connectivity, dynamic minimum spanning trees, and the sparsification technique. The latter case includes dynamic transitive closure and dynamic shortest paths. We also discuss the design and implementation of a software library for dynamic graph algorithms.