A DECOMPOSITION STRATEGY FOR THE VERTEX COVER PROBLEM

[1] CHARACTERIZATIONS OF TOTALLY BALANCED MATRICES [J]. JOURNAL OF ALGORITHMS, 1984, 5 (02) : 215 - 230

[2] BERTOLAZZI P, 1988, SIAM J DISCRETE MATH

[3] CHARACTERIZATIONS OF STRONGLY CHORDAL GRAPHS [J]. DISCRETE MATHEMATICS, 1983, 43 (2-3) : 173 - 189

[4] FRANK A, 1976, C NUMERANTIUM

[5] Gallai T., 1959, ANN U SCI BUDAP, V2, P133

[6] THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1985, 6 (03): : 434 - 451

[7] MATROIDS WITH MAX-FLOW MIN-CUT PROPERTY [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1977, 23 (2-3) : 189 - 222

[1] CHARACTERIZATIONS OF TOTALLY BALANCED MATRICES [J]. JOURNAL OF ALGORITHMS, 1984, 5 (02) : 215 - 230

[2] BERTOLAZZI P, 1988, SIAM J DISCRETE MATH

[3] CHARACTERIZATIONS OF STRONGLY CHORDAL GRAPHS [J]. DISCRETE MATHEMATICS, 1983, 43 (2-3) : 173 - 189

[4] FRANK A, 1976, C NUMERANTIUM

[5] Gallai T., 1959, ANN U SCI BUDAP, V2, P133

[6] THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1985, 6 (03): : 434 - 451

[7] MATROIDS WITH MAX-FLOW MIN-CUT PROPERTY [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1977, 23 (2-3) : 189 - 222