scientific article; zbMATH DE number 1187160

zbMATH Open0911.90335MaRDI QIDQ3840367FDOQ3840367

Authors Lisa Fleischer

Publication date 10 August 1998

zbMATH Keywords

weighted graphcactus treeminimum cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
• A near-linear time algorithm for constructing a cactus representation of minimum cuts
• A fast algorithm for cactus representations of minimum cuts
• CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK

Cited in

(8)

• A near-linear time algorithm for constructing a cactus representation of minimum cuts
• Compact cactus representations of all non-trivial min-cuts
• Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
• scientific article; zbMATH DE number 2080090 (Why is no real title available?)
• A fast algorithm for cactus representations of minimum cuts
• scientific article; zbMATH DE number 2086917 (Why is no real title available?)
• How to draw the minimum cuts of a planar graph
• A cactus theorem for end cuts

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840367)