Generalizing the all-pairs min cut problem

DOI10.1016/0012-365X(94)00233-9zbMath0841.05015OpenAlexW1969525246MaRDI QIDQ1910514

David B. Hartvigsen

Publication date: 24 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00233-9

zbMATH Keywords

matroidsmin cut problem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Flow trees for vertex-capacitated networks ⋮ Multiroute flows: cut-trees and realizability

Cites Work

• Multi-terminal maximum flows in node-capacitated networks
• The matroids with the max-flow min-cut property
• A decomposition of the matroids with the max-flow min-cut property
• Solution Bases of Multiterminal Cut Problems
• Multi-Terminal Network Flows
• Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
• Über reguläre Kettengruppen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalizing the all-pairs min cut problem