Matroid T-connectivity

J.F. Geelen; A.M.H. Gerards; G. Whittle

doi:10.1137/050634190

Matroid T-connectivity

J.F. Geelen, A.M.H. Gerards, G. Whittle

Combinatorial Optimization - EIDMA

Research output: Contribution to journal › Article › Academic › peer-review

4 Citations (Scopus)

67 Downloads (Pure)

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	https://doi.org/10.1137/050634190
Publication status	Published - 2006

Access to Document

10.1137/050634190

624149Final published version, 146 KB

Fingerprint Dive into the research topics of 'Matroid T-connectivity'. Together they form a unique fingerprint.

Cite this

@article{18ef1ad4585047e5bd777eee35258ef6,

title = "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.",

author = "J.F. Geelen and A.M.H. Gerards and G. Whittle",

year = "2006",

doi = "10.1137/050634190",

language = "English",

volume = "20",

pages = "588--596",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

number = "3",

}

TY - JOUR

T1 - Matroid T-connectivity

AU - Geelen, J.F.

AU - Gerards, A.M.H.

AU - Whittle, G.

PY - 2006

Y1 - 2006

N2 - We introduce a new generalization of the maximum matching problem to matroids; this problem includes Gallai's $T$-path problem for graphs.

AB - We introduce a new generalization of the maximum matching problem to matroids; this problem includes Gallai's $T$-path problem for graphs.

U2 - 10.1137/050634190

DO - 10.1137/050634190

M3 - Article

VL - 20

SP - 588

EP - 596

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 3

ER -