Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge and Biconnectivity
Research output: Contribution to journal › Journal article › Research › peer-review
| Translated title of the contribution | Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge and Biconnectivity |
|---|---|
| Original language | English |
| Journal | Journal of the ACM |
| Volume | 48 |
| Issue number | 4 |
| Pages (from-to) | 723-760 |
| Number of pages | 38 |
| ISSN | 0004-5411 |
| Publication status | Published - 2001 |
| Externally published | Yes |
ID: 98319507