CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK

DOI10.15807/JORSJ.39.135zbMATH Open0870.90098OpenAlexW2134413466MaRDI QIDQ5284939FDOQ5284939

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

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

zbMATH Keywords

maximum flowminimum cutscactus representationedge-weighted, undirected network

Mathematics Subject Classification ID

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

Cited In (12)

• 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?)
• Network Analysis
• Extracting maximal information about sets of minimum cuts
• A fast algorithm for cactus representations of minimum cuts
• Canonical cactus representation for miminum cuts
• A near-linear time algorithm for constructing a cactus representation of minimum cuts
• Phylogenetic graph models beyond trees
• Title not available (Why is that?)
• Title not available (Why is that?)

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)