CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
From MaRDI portal
Publication:5284939
DOI10.15807/jorsj.39.135zbMath0870.90098OpenAlexW2134413466MaRDI QIDQ5284939
Tiko Kameda, Hiroshi Nagamochi
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
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
How to draw the minimum cuts of a planar graph, Canonical cactus representation for miminum cuts, A fast algorithm for cactus representations of minimum cuts, Phylogenetic graph models beyond trees