Minimum cuts in parametric networks

DOI10.1007/BF02366447zbMath0837.90044MaRDI QIDQ1905228

F. A. Sharifov

Publication date: 8 January 1996

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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (1)

Minimum cut problem using bases of extended polymatroids

Cites Work

• Unnamed Item
• On submodular function minimization
• A Fast and Simple Algorithm for the Maximum Flow Problem
• Minimum cuts and related problems
• A Fast Parametric Maximum Flow Algorithm and Applications

This page was built for publication: Minimum cuts in parametric networks