ON ALGORITHMS FOR OBTAINING A MAXIMUM TRANSVERSAL

[1] Berge C., 1962, THEORY GRAPHS

[2] BUNCH JR, 1976, 1975 P C SPARS MATR

[3] Duff I.S., 1978, ACM T MATH SOFTWARE, V4, P137

[4] ALGORITHM 575 - PERMUTATIONS FOR A ZERO-FREE DIAGONAL [F1] [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1981, 7 (03): : 387 - 390

[5] SURVEY OF SPARSE-MATRIX RESEARCH [J]. PROCEEDINGS OF THE IEEE, 1977, 65 (04) : 500 - 535

[6] DUFF IS, 1977, J I MATH APPL, V19, P339

[7] DUFF IS, 1972, THESIS OXFORD ENGLAN

[8] 2 ALGORITHMS FOR BIPARTITE GRAPHS [J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1963, 11 (01): : 183 - 194

[9] Dulmage AL, 1959, T ROY SOC CAN, V3, P1

[10] Ford L. R., 1962, FLOWS NETWORKS

[1] Berge C., 1962, THEORY GRAPHS

[2] BUNCH JR, 1976, 1975 P C SPARS MATR

[3] Duff I.S., 1978, ACM T MATH SOFTWARE, V4, P137

[4] ALGORITHM 575 - PERMUTATIONS FOR A ZERO-FREE DIAGONAL [F1] [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1981, 7 (03): : 387 - 390

[5] SURVEY OF SPARSE-MATRIX RESEARCH [J]. PROCEEDINGS OF THE IEEE, 1977, 65 (04) : 500 - 535

[6] DUFF IS, 1977, J I MATH APPL, V19, P339

[7] DUFF IS, 1972, THESIS OXFORD ENGLAN

[8] 2 ALGORITHMS FOR BIPARTITE GRAPHS [J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1963, 11 (01): : 183 - 194

[9] Dulmage AL, 1959, T ROY SOC CAN, V3, P1

[10] Ford L. R., 1962, FLOWS NETWORKS