Recognizing max-flow min-cut path matrices

DOI10.1016/0167-6377(88)90050-8zbMath0645.90020OpenAlexW2007774717MaRDI QIDQ1103514

Donald K. Wagner, David B. Hartvigsen

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90050-8

zbMATH Keywords

polynomial-time algorithmbinary matroidpath matrix

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

On combinatorial properties of binary spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition of regular matroids
• The matroids with the max-flow min-cut property
• On the perfect graph conjecture
• On certain polytopes associated with graphs
• On the computational power of pushdown automata
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• On Algorithms for Enumerating All Circuits of a Graph
• A New Algorithm for Generating All the Maximal Independent Sets
• Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
• A Solution of the Shannon Switching Game

This page was built for publication: Recognizing max-flow min-cut path matrices