Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
| Image |  |
|---|---|
| Description | scholarly article by Jacob Holm et al published 1 July 2001 in Journal of the ACM |
| Author/s |
author: Mikkel Thorup Jacob Holm |
| Publication date | July 1, 2001 |
| Language | English |
| Country of origin | |
| Wikipedia link | |
| Copyright status | |
| Missing/wrong data? | Edit Wikidata item |