EFFICIENT IMPLEMENTATION OF EDMONDS ALGORITHM FOR MAXIMUM MATCHING ON GRAPHS

[1] BALINSKI ML, 1967, COMBINATORIAL MATHEM, P585

[2] 2 THEOREMS IN GRAPH THEORY [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1957, 43 (09) : 842 - 844

[3] COFFMAN EG, 1972, ACTA INFORM, V1, P200, DOI DOI 10.1007/BF00288685

[4] PATHS TREES AND FLOWERS [J]. CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03): : 449 - &

[5] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2): : 125 - +

[6] CORRECTION [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1971, 20 (01) : 141 - &

[7] OPTIMAL SEQUENCING OF 2 EQUIVALENT PROCESSORS [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (04) : 784 - &

[8] GABOW H, 1972, 328 STANF U COMP SCI

[9] Gabow H.N., 1973, THESIS STANFORD U

[10] Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[1] BALINSKI ML, 1967, COMBINATORIAL MATHEM, P585

[2] 2 THEOREMS IN GRAPH THEORY [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1957, 43 (09) : 842 - 844

[3] COFFMAN EG, 1972, ACTA INFORM, V1, P200, DOI DOI 10.1007/BF00288685

[4] PATHS TREES AND FLOWERS [J]. CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03): : 449 - &

[5] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2): : 125 - +

[6] CORRECTION [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1971, 20 (01) : 141 - &

[7] OPTIMAL SEQUENCING OF 2 EQUIVALENT PROCESSORS [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (04) : 784 - &

[8] GABOW H, 1972, 328 STANF U COMP SCI

[9] Gabow H.N., 1973, THESIS STANFORD U

[10] Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364