Minimum cut problem using bases of extended polymatroids

DOI10.1007/BF02366865zbMath0892.90066MaRDI QIDQ1385774

F. A. Sharifov

Publication date: 3 August 1998

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

minimum cutmaximum floworacle

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

Perfect matchings and extended polymatroid, Perfectly matchable subgraph problem on a bipartite graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient algorithm for the minimum capacity cut problem
• Implementing an efficient minimum capacity cut algorithm
• Minimum cuts in parametric networks
• A Fast and Simple Algorithm for the Maximum Flow Problem
• A new approach to the maximum-flow problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems