scientific article; zbMATH DE number 1187160
From MaRDI portal
Publication:3840367
zbMATH Open0911.90335MaRDI QIDQ3840367FDOQ3840367
Authors: Lisa Fleischer 
Publication date: 10 August 1998
Title of this publication is not available (Why is that?)
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
Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (8)
- Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
- Title not available (Why is that?)
- How to draw the minimum cuts of a planar graph
- Title not available (Why is that?)
- A fast algorithm for cactus representations of minimum cuts
- A near-linear time algorithm for constructing a cactus representation of minimum cuts
- A cactus theorem for end cuts
- Compact cactus representations of all non-trivial min-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)
