CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK

DOI10.15807/JORSJ.39.135MaRDI QIDQ5284939zbMATH OpenOpenAlexFDO

Authors Hiroshi Nagamochi, Tiko Kameda

Publication date 22 January 1997

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.39.135

zbMATH Keywords

cactus representationedge-weighted, undirected networkmaximum flowminimum cuts

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

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
• scientific article; zbMATH DE number 1187160
• 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
• scientific article; zbMATH DE number 1187160 (Why is no real title available?)
• scientific article; zbMATH DE number 1263227 (Why is no real title available?)
• scientific article; zbMATH DE number 1555934 (Why is no real title available?)
• A near-linear time algorithm for constructing a cactus representation of minimum cuts
• 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
• Network Analysis

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)