AN AUGMENTING PATH ALGORITHM FOR LINEAR MATROID PARITY

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] [Anonymous], 1979, COMBINATORIAL THEORY

[3] ON THE ASYMPTOTIC COMPLEXITY OF MATRIX MULTIPLICATION [J]. SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 472 - 492

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

[5] EVEN S, 1975, 16TH P ANN IEEE S F, P100

[6] DECOMPOSING SYMMETRIC EXCHANGES IN MATROID BASES [J]. MATHEMATICAL PROGRAMMING, 1976, 10 (02) : 271 - 276

[7] EFFICIENT IMPLEMENTATION OF EDMONDS ALGORITHM FOR MAXIMUM MATCHING ON GRAPHS [J]. JOURNAL OF THE ACM, 1976, 23 (02) : 221 - 234

[8] A LINEAR-TIME ALGORITHM FOR A SPECIAL CASE OF DISJOINT SET UNION [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (02) : 209 - 221

[9] GABOW HN, 1985, LECT NOTES COMPUT SC, V194, P210

[10] EFFICIENT ALGORITHMS FOR A FAMILY OF MATROID INTERSECTION PROBLEMS [J]. JOURNAL OF ALGORITHMS, 1984, 5 (01) : 80 - 131

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] [Anonymous], 1979, COMBINATORIAL THEORY

[3] ON THE ASYMPTOTIC COMPLEXITY OF MATRIX MULTIPLICATION [J]. SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 472 - 492

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

[5] EVEN S, 1975, 16TH P ANN IEEE S F, P100

[6] DECOMPOSING SYMMETRIC EXCHANGES IN MATROID BASES [J]. MATHEMATICAL PROGRAMMING, 1976, 10 (02) : 271 - 276

[7] EFFICIENT IMPLEMENTATION OF EDMONDS ALGORITHM FOR MAXIMUM MATCHING ON GRAPHS [J]. JOURNAL OF THE ACM, 1976, 23 (02) : 221 - 234

[8] A LINEAR-TIME ALGORITHM FOR A SPECIAL CASE OF DISJOINT SET UNION [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (02) : 209 - 221

[9] GABOW HN, 1985, LECT NOTES COMPUT SC, V194, P210

[10] EFFICIENT ALGORITHMS FOR A FAMILY OF MATROID INTERSECTION PROBLEMS [J]. JOURNAL OF ALGORITHMS, 1984, 5 (01) : 80 - 131