Abstract
We introduce a new generalization of the maximum matching problem to matroids; this problem includes Gallai's $T$-path problem for graphs.
Original language | English |
---|---|
Pages (from-to) | 588-596 |
Journal | SIAM Journal on Discrete Mathematics |
Volume | 20 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2006 |