Matroid $T$-Connectivity

Abstract

We introduce a new generalization of the maximum matching problem to matroids; this problem includes Gallai’s T path Problem for graphs. 
DOI: 10.1137/050634190

Topics

Cite this paper

@article{Geelen2006Matroid, title={Matroid \$T\$-Connectivity}, author={James F. Geelen and Bert Gerards and Geoff Whittle}, journal={SIAM J. Discrete Math.}, year={2006}, volume={20}, pages={588-596} }