A data structure for dynamic trees
Journal of Computer and System Sciences
Amortized analysis of algorithms for set union with backtracking
SIAM Journal on Computing
Maintenance of a minimum spanning forest in a dynamic plane graph
Journal of Algorithms
Fully dynamic algorithms for 2-edge connectivity
SIAM Journal on Computing
Complexity models for incremental computation
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Separator based sparsification I.: planarity testing and minimum spanning trees
Journal of Computer and System Sciences
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
SIAM Journal on Computing
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
Sampling to provide or to bound: with applications to fully dynamic graph algorithms
Proceedings of the workshop on Randomized algorithms and computation
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Improved Data Structures for Fully Dynamic Biconnectivity
SIAM Journal on Computing
Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Minimum cuts in near-linear time
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
Dynamic generators of topologically embedded graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamizing static algorithms, with applications to dynamic trees and history independence
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for dynamic connectivity
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
Dynamic maintenance of molecular surfaces under conformational changes
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An O (n log n) algorithm for maximum st-flow in a directed planar graph
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Dynamic connectivity for axis-parallel rectangles
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Multiple source shortest paths in a genus g graph
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Embedding into l2∞ is easy embedding into l2∞ is NP-complete
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic algorithm for graph spanners with poly-logarithmic update time
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic algorithms for chordal graphs and split graphs
ACM Transactions on Algorithms (TALG)
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Theoretical Computer Science
An O(n log n) algorithm for maximum st-flow in a directed planar graph
Journal of the ACM (JACM)
An experimental analysis of self-adjusting computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Maintaining dynamic minimum spanning trees: An experimental study
Discrete Applied Mathematics
Maintaining a large matching and a small vertex cover
Proceedings of the forty-second ACM symposium on Theory of computing
Self-adjusting computation with Delta ML
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
New data structures for subgraph connectivity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
Dynamic approximate vertex cover and maximum matching
Property testing
Dynamic approximate vertex cover and maximum matching
Property testing
Brief announcement: a randomized algorithm for label assignment in dynamic networks
DISC'11 Proceedings of the 25th international conference on Distributed computing
Dynamic Connectivity: Connecting to Networks and Geometry
SIAM Journal on Computing
Empire of Colonies: self-stabilizing and self-organizing distributed algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Efficient and simple generation of random simple connected graphs with prescribed degree sequence
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Computing replacement paths in surface embedded graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved maintenance of molecular surfaces using dynamic graph connectivity
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
A planar linear arboricity conjecture
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Journal of Graph Theory
Path selection in user-controlled circuit-switched optical networks
Optical Switching and Networking
Research paper: The saga of minimum spanning trees
Computer Science Review
Fully dynamic randomized algorithms for graph spanners
ACM Transactions on Algorithms (TALG)
A Repository for Multirelational Dynamic Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Simple deterministic algorithms for fully dynamic maximal matching
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Efficient processing of streaming graphs for evolution-aware clustering
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.01 |
This paper solves a longstanding open problem in fully dynamic algorithms: We present the first fully dynamic algorithms that maintain connectivity, bipartiteness, and approximate minimum spanning trees in polylogarithmic time per edge insertion or deletion. The algorithms are designed using a new dynamic technique that combines a novel graph decomposition with randomization. They are Las-Vegas type randomized algorithms which use simple data structures and have a small constant factor.Let n denote the number of nodes in the graph. For a sequence of &OHgr;(m0) operations, where m0 is the number of edges in the initial graph, the expected time for p updates is O(p log3 n) (througout the paper the logarithms are based 2) for connectivity and bipartiteness. The worst-case time for one query is O(log n/log log n). For the k-edge witness problem (“Does the removal of k given edges disconnect the graph?”) the expected time for p updates is O(p log3 n) and the expected time for q queries is O(qk log3 n). Given a graph with k different weights, the minimum spanning tree can be maintained during a sequence of p updates in expected time O(pk log3 n). This implies an algorithm to maintain a 1 + &egr;-approximation of the minimum spanning tree in expected time O((p log3 n logU)/&egr;) for p updates, where the weights of the edges are between 1 and U.