Optimum matching forests III: Facets of matching forest polyhedra
From MaRDI portal
Publication:3922480
DOI10.1007/BF01581024zbMath0468.90055MaRDI QIDQ3922480
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
facetsmixed graphmatching polyhedrabranching polyhedramatching forest polyhedraoptimum matching forests
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Linear programming (90C05) Directed graphs (digraphs), tournaments (05C20) Polytopes and polyhedra (52Bxx)
Related Items
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs ⋮ Equitable partitions into matchings and coverings in mixed graphs ⋮ Optimal Matching Forests and Valuated Delta-Matroids ⋮ Proving total dual integrality with cross-free families—A general framework ⋮ Structural properties of matroid matchings ⋮ An efficient algorithm for minimum-weight bibranching ⋮ Optimum matching forests II: General weights
Cites Work