On ideal clutters, metrics and multiflows

DOI10.1007/3-540-61310-2_21zbMath1415.90107OpenAlexW1581620717MaRDI QIDQ4645929

Beth Novick, András Sebő

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_21

zbMATH Keywords

perfect graphsigned graphmulticommodity flowincidence vectorcolorable perfect

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites Work

• Combinatorial approaches to multiflow problems
• Decomposition of regular matroids
• Matroids and multicommodity flows
• The matroids with the max-flow min-cut property
• A note on the production of matroid minors
• A catalog of minimally nonideal matrices
• Ideal 0, 1 matrices
• Sums of cuts and bipartite metrics
• Uniquely colorable perfect graphs
• Minimal imperfect graphs: A simple approach
• Combinatorial designs and related systems
• On the Extreme Rays of the Metric Cone
• The Forbidden Minors of Binary Clutters
• On combinatorial properties of binary spaces
• A Solution of the Shannon Switching Game
• Bottleneck extrema
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On ideal clutters, metrics and multiflows