Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance

DOI10.1007/978-3-642-29700-7_3zbMath1304.90210OpenAlexW1588184679MaRDI QIDQ2897979

Enyu Yao, Biao Wu, Yong Chen, Longcheng Liu

Publication date: 16 July 2012

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29700-7_3

zbMATH Keywords

inverse problemminimum cutHamming distancestrongly polynomial algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Capacitated partial inverse maximum spanning tree under the weighted Hamming distance

This page was built for publication: Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance