Optimum matching forests II: General weights

DOI10.1007/BF01581023zbMath0468.90054OpenAlexW2082699538MaRDI QIDQ3922479

Rick Giles

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581023

zbMATH Keywords

polyhedrondirected graphmatchingsbranchingsundirected graphedge weightsoptimum matching forests

Mathematics Subject Classification ID

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 (9)

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 I: Special weights ⋮ Optimum matching forests III: Facets of matching forest polyhedra ⋮ Recent trends in combinatorial optimization

Cites Work

• Optimum matching forests I: Special weights
• Optimum matching forests III: Facets of matching forest polyhedra
• Maximum matching and a polyhedron with 0,1-vertices
• Optimum branchings
• The Factorization of Linear Graphs
• The Factors of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimum matching forests II: General weights