arXiv (All)
open access
Dynamic Connectivity, Minimum Spanning Tree, and 2-Edge Connectivity with Polylogarithmic Worst-Case Update Time
We give fully dynamic algorithms for maintaining connectivity, minimum spanning tree, and $2$-edge connectivity of a graph with worst-case polylogarithmic update time. Our algorithms are randomized and succeed with high probability against an adaptive adversary. For the minimum spanning tree and $2$
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks#427472
- Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction#799512
- Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction#798089
- Randomly perturbed digraphs also have bounded-degree spanning trees#206107
- A Deterministic $(2+\varepsilon)$-Approximation for Weighted Feedback Vertex Set in Tournaments#1109265
Record · ID 1155426
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive