A GRAPH PARTITIONING ALGORITHM BY NODE SEPARATORS

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

[2] Berge C., 1973, GRAPHS HYPERGRAPHS

[3] COX P, 1986, P IEEE ACM INT C COM, P186

[4] ON THE PROBLEM OF PARTITIONING PLANAR GRAPHS [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (02): : 229 - 240

[5] Duff I., 1982, SIGNUM Newsletter, V17, DOI 10.1145/1057588.1057590

[6] ON ALGORITHMS FOR OBTAINING A MAXIMUM TRANSVERSAL [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1981, 7 (03): : 315 - 330

[7] REMARKS ON IMPLEMENTATIONS OF O(N1/2 TAU) ASSIGNMENT ALGORITHMS [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1988, 14 (03): : 267 - 287

[8] DUFF IS, 1987, DIRECT METHODS SPARS

[9] Fiduccia CM, 1982, 19TH P DES AUT C, P175, DOI DOI 10.1109/DAC.1982.1585498

[10] GEORGE A, 1981, COMPUTER SOLUTION LA

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

[2] Berge C., 1973, GRAPHS HYPERGRAPHS

[3] COX P, 1986, P IEEE ACM INT C COM, P186

[4] ON THE PROBLEM OF PARTITIONING PLANAR GRAPHS [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (02): : 229 - 240

[5] Duff I., 1982, SIGNUM Newsletter, V17, DOI 10.1145/1057588.1057590

[6] ON ALGORITHMS FOR OBTAINING A MAXIMUM TRANSVERSAL [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1981, 7 (03): : 315 - 330

[7] REMARKS ON IMPLEMENTATIONS OF O(N1/2 TAU) ASSIGNMENT ALGORITHMS [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1988, 14 (03): : 267 - 287

[8] DUFF IS, 1987, DIRECT METHODS SPARS

[9] Fiduccia CM, 1982, 19TH P DES AUT C, P175, DOI DOI 10.1109/DAC.1982.1585498

[10] GEORGE A, 1981, COMPUTER SOLUTION LA