Optimum matching forests II: General weights
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3496213 (Why is no real title available?)
- scientific article; zbMATH DE number 3499169 (Why is no real title available?)
- scientific article; zbMATH DE number 3637616 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- Maximum matching and a polyhedron with 0,1-vertices
- Optimum branchings
- Optimum matching forests I: Special weights
- Optimum matching forests III: Facets of matching forest polyhedra
- The Factorization of Linear Graphs
- The Factors of Graphs
Cited in
(9)- Structural properties of matroid matchings
- An efficient algorithm for minimum-weight bibranching
- 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
- Optimum matching forests I: Special weights
- Optimum matching forests III: Facets of matching forest polyhedra
- Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
- Recent trends in combinatorial optimization
This page was built for publication: Optimum matching forests II: General weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922479)