Login / Signup

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

Jacob HolmKristian de LichtenbergMikkel 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