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

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 79-89

  Holm, Jacob ^a   de Lichtenberg, Kristian ^a   Thorup, Mikkel ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

BICONNECTIVITY PROBLEMS;

GRAPH THEORY;

EID: 0031619858     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/276698.276715     Document Type: Conference Paper

References (20)