Decomposition algorithms for minimal cut problems

DOI10.1002/nav.3800280308zbMath0464.90080OpenAlexW2070409127MaRDI QIDQ3916392

Suleyman Tufekci

Publication date: 1981

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800280308

zbMATH Keywords

decomposition algorithmsflow networksubnetworksminimal cut problemsone-node cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Cites Work

• Flow Switching Approach to the Maximum Flow Problem: I
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition algorithms for minimal cut problems