A generalization of Edmonds' matching and matroid intersection algorithms

DOI10.1007/3-540-47867-1_2MaRDI QIDQ4737513zbMATH OpenFDO

Authors Bianca Spille, Robert Weismantel

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370009.htm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Facets of the independent path-matching polytope
• Matching, matroids, and extensions
• Generalized matroid matching
• Note on the path‐matching formula
• A weighted linear matroid parity algorithm

Cited in

(16)

• The optimal path-matching problem
• The unimodular intersection problem
• Matching, matroids, and extensions
• Improved algorithms for even factors and square-free simple \(b\)-matchings
• A matroid view of key theorems for edge-swapping algorithms
• Edmonds, matching and the birth of polyhedral combinatorics
• Generalized matroid matching
• A weighted independent even factor algorithm
• Facets of the independent path-matching polytope
• scientific article; zbMATH DE number 4068895 (Why is no real title available?)
• Algorithmic characterization of bipartite b-matching and matroid intersection
• A Gallai–Edmonds‐type structure theorem for path‐matchings
• Valuated Matroid Intersection II: Algorithms
• Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
• Combinatorial algorithms for matchings, even factors and square-free 2-factors
• A weighted even factor algorithm

This page was built for publication: A generalization of Edmonds' matching and matroid intersection algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737513)