Determining minimal cuts with a minimal number of arcs

DOI10.1002/NET.3230120413zbMATH Open0495.90083OpenAlexW1983337355MaRDI QIDQ3959764

Horst W. Hamacher

Publication date: 1982

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230120413

zbMATH Keywords

minimal cutsmatroid theoryminimal number of arcsshortest path theory

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Minimal cost flows in regular matroids
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: Determining minimal cuts with a minimal number of arcs