Login / Signup
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.
Jacob Holm
Kristian de Lichtenberg
Mikkel Thorup
Published in:
J. ACM (2001)
Keyphrases
</>
minimum spanning tree
graph theory
spanning tree
data structure
weighted graph
computational complexity
worst case
lower bound
special case
cost function
long range
space filling curves