Optimal matching forests and valuated delta-matroids
From MaRDI portal
(Redirected from Publication:4979849)
Optimal matching forests and valuated delta-matroids (scientific article; zbMATH DE number 6305462)
Optimal matching forests and valuated delta-matroids (scientific article; zbMATH DE number 6305462)
Recommendations
Cited in
(13)- \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids
- Relationship of two formulations for shortest bibranchings
- A note on M-convex functions on jump systems
- Equitable partitions into matchings and coverings in mixed graphs
- Optimal matching forests and valuated delta-matroids
- Matching problems with delta-matroid constraints
- Even delta-matroids and the complexity of planar Boolean CSPs
- A survey of fundamental operations on discrete convex functions of various kinds
- On basic operations related to network induction of discrete convex functions
- Total dual integrality of matching forest constraints
- 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
- -graphic delta-matroids and their applications
This page was built for publication: Optimal matching forests and valuated delta-matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979849)