Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC) |
| Publisher | ACM |
| Publication date | 1998 |
| Pages | 79-89 |
| Publication status | Published - 1998 |
| Externally published | Yes |
ID: 213937