Multiterminal flows and cuts

DOI10.1016/0167-6377(95)00018-FzbMath0858.90051MaRDI QIDQ1924611

Margot, François, David B. Hartvigsen

Publication date: 20 October 1996

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

undirected graphsmax flow/min cut theoremminimal collections of cuts in a graph

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (2)

The planar multiterminal cut problem ⋮ Multiroute flows: cut-trees and realizability

Cites Work

• Unnamed Item
• Unnamed Item
• Maximal Flow Through a Network
• Solution Bases of Multiterminal Cut Problems
• Multi-Terminal Network Flows
• On some connectivity properties of Eulerian graphs
• Optimal Linear Ordering

This page was built for publication: Multiterminal flows and cuts