Faster randomized worst-case update time for dynamic subgraph connectivity

DOI10.1007/978-3-319-62127-2_29zbMath1493.68266arXiv1611.09072OpenAlexW2612703217MaRDI QIDQ2405295

Le Zhang, Ran Duan

Publication date: 22 September 2017

Full work available at URL: https://arxiv.org/abs/1611.09072

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Randomized algorithms (68W20)

Related Items (4)

Fault tolerant depth first search in undirected graphs: simple yet efficient ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier ⋮ Fully Dynamic Connectivity Oracles under General Vertex Updates

This page was built for publication: Faster randomized worst-case update time for dynamic subgraph connectivity