MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Independent Even Factor Problem

[1]  M. Iri,et al.  Use of matroid theory in operations research, circuits and systems theory , 1981 .

[2]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[3]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[4]  Robert Weismantel,et al.  A Generalization of Edmonds' Matching and Matroid Intersection Algorithms , 2002, IPCO.

[5]  Gyula Pap,et al.  On the maximum even factor in weakly symmetric graphs , 2004, J. Comb. Theory, Ser. B.

[6]  Alexander Schrijver,et al.  Matroids and linking systems , 1979, J. Comb. Theory B.

[7]  William H. Cunningham,et al.  The optimal path-matching problem , 1997, Comb..

[8]  Nicholas J. A. Harvey.  Algebraic Structures and Algorithms for Matching and Matroid Problems , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[9]  W. T. Tutte.  The Factorization of Linear Graphs , 1947 .

[10]  Masao Iri,et al.  A REVIEW OF RECENT WORK IN JAPAN ON PRINCIPAL PARTITIONS OF MATROIDS AND THEIR APPLICATIONS 1 , 1979 .

[11]  Bianca Spille,et al.  A Gallai–Edmonds-type structure theorem for path-matchings , 2004 .

[12]  Eugene L. Lawler,et al.  Matroid intersection algorithms , 1975, Math. Program..

[13]  András Frank,et al.  Note on the path-matching formula , 2002, J. Graph Theory.

[14]  Hazel Perfect,et al.  Independence Spaces and Combinatorial Problems , 1969 .

[15]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[16]  Gyula Pap,et al.  A Combinatorial Algorithm to Find a Maximum Even Factor , 2005, IPCO.