A near-linear time algorithm for constructing a cactus representation of minimum cuts
From MaRDI portal
(Redirected from Publication:4633832)
Recommendations
- A fast algorithm for cactus representations of minimum cuts
- scientific article; zbMATH DE number 1187160
- Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
- CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
- Deterministic global minimum cut of a simple graph in near-linear time
Cited in
(17)- Canonical cactus representation for miminum cuts
- Compact cactus representations of all non-trivial min-cuts
- A fast algorithm for cactus representations of minimum cuts
- A single exponential-time FPT algorithm for cactus contraction
- Deformable Polygon Representation and Near-Mincuts
- scientific article; zbMATH DE number 1187160 (Why is no real title available?)
- scientific article; zbMATH DE number 1263227 (Why is no real title available?)
- Minimum cuts and sparsification in hypergraphs
- scientific article; zbMATH DE number 2086917 (Why is no real title available?)
- Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
- CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
- Space complexity of vertex connectivity oracles
- Streaming algorithms for connectivity augmentation
- Computing the 4-edge-connected components of a graph: an experimental study
- Efficient contractions of dynamic graphs -- with applications
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- On finding fundamental cut sets
This page was built for publication: A near-linear time algorithm for constructing a cactus representation of minimum cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633832)
