Optimum matching forests I: Special weights

DOI10.1007/BF01581022zbMath0468.90053MaRDI QIDQ3922478

Rick Giles

Publication date: 1982

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

zbMATH Keywords

combinatorial optimizationdirected graphmatchingsbranchingsundirected graphefficient algorithmmatching 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)

Related Items

"Equation missing" -Integral Points on a Mordell Curve, 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, On a classification of independence systems, Solving the linear matroid parity problem as a sequence of matroid intersection problems, An efficient algorithm for minimum-weight bibranching, Optimum matching forests II: General weights, Optimum matching forests III: Facets of matching forest polyhedra, Fundamental cycles and graph embeddings, Recent trends in combinatorial optimization

Cites Work

• Optimum matching forests II: General weights
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
• Finding optimum branchings
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Optimum branchings
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item