Connectivity oracles for predictable vertex failures
From MaRDI portal
Cites work
- Algorithms and data structures for first-order logic with connectivity under vertex failures
- Algorithms with Predictions
- Connectivity oracles for failure prone graphs
- Connectivity oracles for graphs subject to vertex failures
- Connectivity oracles for graphs subject to vertex failures
- Connectivity queries under vertex failures: not optimal, but practical
- Deterministic Fault-Tolerant Connectivity Labeling Scheme
- Dynamic connectivity: connecting to networks and geometry
- Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
- Dynamic graph connectivity in polylogarithmic worst case time
- Dynamically switching vertices in planar graphs
- Faster randomized worst-case update time for dynamic subgraph connectivity
- Fault-Tolerant Labeling and Compact Routing Schemes
- Higher lower bounds from the 3SUM conjecture
- Incremental and fully dynamic subgraph connectivity for emergency planning
- Informative labeling schemes for graphs
- Monochromatic triangles, triangle listing and APSP
- Near-optimal deterministic vertex-failure connectivity oracles
- New data structures for subgraph connectivity
- On dynamic graph algorithms with predictions
- On the complexity of algorithms with predictions for dynamic graph problems
- Orthogonal range searching on the RAM, revisited
- Popular conjectures imply strong lower bounds for dynamic problems
- Sensitive distance and reachability oracles for large batch updates
- The level ancestor problem simplified
- Tight dynamic problem lower bounds from generalized BMM and OMv
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
This page was built for publication: Connectivity oracles for predictable vertex failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253138)
