Near-optimal deterministic vertex-failure connectivity oracles
From MaRDI portal
Cited in
(8)- Better decremental and fully dynamic sensitivity oracles for subgraph connectivity
- Finding most-shattering minimum vertex cuts of polylogarithmic size in near-linear time
- Vertex sparsifiers for hyperedge connectivity
- Connectivity oracles for predictable vertex failures
- Mimicking networks for constrained multicuts in hypergraphs
- Near-optimal vertex fault-tolerant labels for Steiner connectivity
- Length-constrained directed expander decomposition and length-constrained vertex-capacitated flow shortcuts
- Submodular hypergraph partitioning: metric relaxations and fast algorithms via an improved cut-matching game
This page was built for publication: Near-optimal deterministic vertex-failure connectivity oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942990)
