Sampling to provide or to bound: with applications to fully dynamic graph algorithms

Authors:
Monika R. Henzinger;Mikkel Thorup
Affiliations:
-;-
Venue:
Proceedings of the workshop on Randomized algorithms and computation
Year:
1997

Citing 0
Cited 11

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

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A fully dynamic algorithm for maintaining the transitive closure

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Randomized fully dynamic graph algorithms with polylogarithmic time per operation

Journal of the ACM (JACM)
Near-optimal fully-dynamic graph connectivity

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Fully Dynamic Maintenance of k-Connectivity in Parallel

IEEE Transactions on Parallel and Distributed Systems
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Journal of the ACM (JACM)
A fully dynamic algorithm for maintaining the transitive closure

Journal of Computer and System Sciences - STOC 1999
Implementations and experimental studies of dynamic graph algorithms

Experimental algorithmics
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms

Journal of Experimental Algorithmics (JEA)
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms

Journal of Experimental Algorithmics (JEA)
Dynamic graph algorithms

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract