Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs

Authors:
Monika Rauch Henzinger;Johannes A. La Poutré
Affiliations:
-;-
Venue:
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Year:
1995

Citing 0
Cited 7

Sparsification—a technique for speeding up dynamic graph algorithms

Journal of the ACM (JACM)
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
Fully dynamic planarity testing with applications

Journal of the ACM (JACM)
Randomized fully dynamic graph algorithms with polylogarithmic time per operation

Journal of the ACM (JACM)
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)
Dynamic graph algorithms

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract