LINEAR ALGORITHMS FOR TESTING SIGN STABILITY OF A MATRIX AND FOR FINDING Z-MAXIMUM MATCHINGS IN ACYCLIC GRAPHS

[1] AHO AV, 1975, DESIGN ANALYSIS COMP

[2] ANDERSON WN, 1975, SIAM J APPL MATH, V28, P114, DOI 10.1137/0128011

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

[4] CHARTRES BA, 1959, IBME1481 BROWN U DIV

[5] THEOREMS ON CHEMICAL NETWORK STABILITY [J]. JOURNAL OF CHEMICAL PHYSICS, 1975, 62 (03) : 773 - 775

[6] Cockayne E., 1975, Information Processing Letters, V4, P41, DOI 10.1016/0020-0190(75)90011-3

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

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

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

[10] Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P225, DOI 10.1137/0202019

[1] AHO AV, 1975, DESIGN ANALYSIS COMP

[2] ANDERSON WN, 1975, SIAM J APPL MATH, V28, P114, DOI 10.1137/0128011

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

[4] CHARTRES BA, 1959, IBME1481 BROWN U DIV

[5] THEOREMS ON CHEMICAL NETWORK STABILITY [J]. JOURNAL OF CHEMICAL PHYSICS, 1975, 62 (03) : 773 - 775

[6] Cockayne E., 1975, Information Processing Letters, V4, P41, DOI 10.1016/0020-0190(75)90011-3

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

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

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

[10] Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P225, DOI 10.1137/0202019