Generalizing the all-pairs min cut problem

DOI10.1016/0012-365X(94)00233-9MaRDI QIDQ1910514zbMATH OpenOpenAlexFDO

Authors David 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)

Recommendations

• The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
• Faster algorithms for all-pairs bounded min-cuts
• All-pairs min-cut in sparse networks
• All-Pairs Min-Cut in Sparse Networks
• Minimum T-cuts and optimal T-pairings
• Generalized \(k\)-multiway cut problems
• A new approach to the minimum cut problem
• scientific article; zbMATH DE number 7651198
• All-pairs minimum cuts in near-linear time for surface-embedded graphs
• A Deterministic Algorithm for Finding All Minimum k‐Way Cuts

Cites work

• scientific article; zbMATH DE number 4010154 (Why is no real title available?)
• scientific article; zbMATH DE number 53949 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3568333 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3227800 (Why is no real title available?)
• scientific article; zbMATH DE number 3290885 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• scientific article; zbMATH DE number 3365043 (Why is no real title available?)
• scientific article; zbMATH DE number 3200669 (Why is no real title available?)
• A decomposition of the matroids with the max-flow min-cut property
• Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
• Multi-Terminal Network Flows
• Multi-terminal maximum flows in node-capacitated networks
• Solution Bases of Multiterminal Cut Problems
• The matroids with the max-flow min-cut property
• Über reguläre Kettengruppen

Cited in

(3)

• Flow trees for vertex-capacitated networks
• Multiroute flows: cut-trees and realizability
• All-Pairs Min-Cut in Sparse Networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910514)