Fully dynamic connectivity oracles under general vertex updates
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs
- A data structure for dynamic trees
- Dynamic connectivity: connecting to networks and geometry
- Dynamic graph connectivity in polylogarithmic worst case time
- Faster deterministic fully-dynamic graph connectivity
- Faster randomized worst-case update time for dynamic subgraph connectivity
- Faster worst case deterministic dynamic connectivity
- Fully dynamic all-pairs shortest paths with worst-case update-time revisited
- Incremental DFS algorithms: a theoretical and experimental study
- New data structures for subgraph connectivity
- Range predecessor and Lempel-Ziv parsing
Cited in
(7)- Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
- Connectivity oracles for graphs subject to vertex failures
- Dynamic Subgraph Connectivity with Geometric Applications
- Connectivity oracles for failure prone graphs
- Optimal consistent network updates in polynomial time
- Dynamic connectivity: connecting to networks and geometry
- Connectivity oracles for graphs subject to vertex failures
This page was built for publication: Fully dynamic connectivity oracles under general vertex updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136280)
