CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
From MaRDI portal
Recommendations
- A fast algorithm for cactus representations of minimum cuts
- A near-linear time algorithm for constructing a cactus representation of minimum cuts
- Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
- Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time
- Canonical cactus representation for miminum cuts
Cited in
(12)- Phylogenetic graph models beyond trees
- Extracting maximal information about sets of minimum cuts
- Canonical cactus representation for miminum cuts
- How to draw the minimum cuts of a planar graph
- A fast algorithm for cactus representations of minimum cuts
- Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time
- scientific article; zbMATH DE number 1263227 (Why is no real title available?)
- Computing all small cuts in undirected networks
- A near-linear time algorithm for constructing a cactus representation of minimum cuts
- A new approach to cactus construction applied to TSP support graphs
- Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
- Chapter 7. Connectivity
This page was built for publication: CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284939)