A fast algorithm for cactus representations of minimum cuts
From MaRDI portal
Publication:2258383
DOI10.1007/BF03167346zbMath1306.90165MaRDI QIDQ2258383
Toshihide Ibaraki, Hiroshi Nagamochi, Yoshitaka Nakao
Publication date: 3 March 2015
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Related Items
Graph connectivity and its augmentation: Applications of MA orderings, Phylogenetic graph models beyond trees, An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree, Computing finest mincut partitions of a graph and application to routing problems