Optimal Matching Forests and Valuated Delta-Matroids

DOI10.1137/110827661zbMath1294.90054OpenAlexW1976142447MaRDI QIDQ4979849

Kenjiro Takazawa

Publication date: 19 June 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c4166b1d3ef77bee0bee2f7469da5144212ca2ae

zbMATH Keywords

matching forestbranchingprimal-dual algorithmdelta-matroidvaluated delta-matroid

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs ⋮ The b‐bibranching problem: TDI system, packing, and discrete convexity ⋮ A note on M-convex functions on jump systems ⋮ Equitable partitions into matchings and coverings in mixed graphs ⋮ Relationship of two formulations for shortest bibranchings ⋮ A survey of fundamental operations on discrete convex functions of various kinds ⋮ On basic operations related to network induction of discrete convex functions

This page was built for publication: Optimal Matching Forests and Valuated Delta-Matroids