Combinatorial algorithms for matchings, even factors and square-free 2-factors
成果类型：
Article; Proceedings Paper
署名作者：
Pap, Gyula
署名单位：
Eotvos Lorand University
刊物名称：
MATHEMATICAL PROGRAMMING
ISSN/ISSBN：
0025-5610
DOI：
10.1007/s10107-006-0053-9
发表日期：
2007
页码：
57-69
关键词：
摘要：
Even factors and square-free 2-factors are restricted matching problems for which it seems to be difficult to generalize Edmonds' matching algorithm directly. Here, we present a slight modification of Edmonds' algorithm, which adapts to these restricted matching problems. Thus, we construct algorithms for these problems which do not use alternating forests.
来源URL：