What are principal typings and what are they good for?
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
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
Experimental analysis of dynamic minimum spanning tree algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
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
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
A fully dynamic algorithm for maintaining the transitive closure
Journal of Computer and System Sciences - STOC 1999
Maintaining all-pairs approximate shortest paths under deletion of edges
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
An Experimental Study of Dynamic Algorithms for Directed Graphs
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Incremental recomputation in local languages
Information and Computation
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
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
An Experimental Study of Dynamic Algorithms for Transitive Closure
Journal of Experimental Algorithmics (JEA)
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
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier
Journal of the ACM (JACM)
Trading off space for passes in graph streaming problems
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)
An experimental study of algorithms for fully dynamic transitive closure
Journal of Experimental Algorithmics (JEA)
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Trading off space for passes in graph streaming problems
ACM Transactions on Algorithms (TALG)
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
Algorithms and theory of computation handbook
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
Replacement paths and k simple shortest paths in unweighted directed graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An experimental study of algorithms for fully dynamic transitive closure
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Subquadratic algorithm for dynamic shortest distances
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Replacement paths and k simple shortest paths in unweighted directed graphs
ACM Transactions on Algorithms (TALG)
Associative version of italiano's decremental algorithm for the transitive closure problem
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract]
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
This paper presents an algorithm for the fully dynamic biconnectivity problem whose running time is exponentially faster than all previously known solutions. It is the first dynamic algorithm that answers biconnectivity queries in time O(log/sup 2/n) in a n-node graph and can be updated after an edge insertion or deletion in polylogarithmic time. Our algorithm is a Las-Vegas style randomized algorithm with the update time amortized update time O(log/sup 4/n). Only recently the best deterministic result for this problem was improved to O(/spl radic/nlog/sup 2/n). We also give the first fully dynamic and a novel deletions-only transitive closure (i.e. directed connectivity) algorithms. These are randomized Monte Carlo algorithms. Let n be the number of nodes in the graph and let m/spl circ/ be the average number of edges in the graph during the whole update sequence: The fully dynamic algorithms achieve (1) query time O(n/logn) and update time O(m/spl circ//spl radic/nlog/sup 2/n+n); or (2) query time O(n/logn) and update time O(nm/spl circ//sup /spl mu/-1/)log/sup 2/n=O(nm/spl circ//sup 0.58/log/sup 2/n), where /spl mu/ is the exponent for boolean matrix multiplication (currently /spl mu/=2.38). The deletions-only algorithm answers queries in time O(n/logn). Its amortized update time is O(nlog/sup 2/n).