Separators in Graphs with Negative and Multiple Vertex Weights

Abstract. A separator theorem for a class of graphs asserts that every graph in the class can be divided approximately in half by removing a set of vertices of specified size. Nontrivial separator theorems hold for several classes of graphs, including graphs of bounded genus and chordal graphs. We show that any separator theorem implies various weighted separator theorems. In particular, we show that if the vertices of the graph have real-valued weights, which may be positive or negative, then the graph can be divided exactly in half according to weight. If k unrelated sets of weights are given, the graph can be divided simultaneously by all k sets of weights. These results considerably strengthen earlier results of Gilbert, Lipton, and Tarjan: (1) for k=1 with the weights restricted to being nonnegative, and (2) for k>1 , nonnegative weights, and simultaneous division within a factor of (1+ε ) of exactly in half.

[1]  Charles E. Leiserson,et al.  A Layout for the Shuffle-Exchange Network. , 1980 .

[2]  Endre Szemerédi,et al.  On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines , 1986, STOC '86.

[3]  Charles E. Leiserson,et al.  Area-Efficient Graph Layouts (for VLSI) , 1980, FOCS.

[4]  C. Jordan.  Sur les assemblages de lignes. , 1869 .

[5]  Ming Li.  Simulating Two Pushdown Stores by One Tape in $O(n^{1.5}\sqrt{logn}$) Time. (Preliminary Version) , 1985 .

[6]  J. Gilbert.  Graph separator theorems and sparse Gaussian elimination , 1980 .

[7]  S. Teng.  Points, spheres, and separators: a unified geometric approach to graph partitioning , 1992 .

[8]  John R Gilbert,et al.  A Separator Theorem for Graphs of Bounded Genus , 1984, J. Algorithms.

[9]  Gary L. Miller,et al.  Finding Small Simple Cycle Separators for 2-Connected Planar Graphs , 1986, J. Comput. Syst. Sci..

[10]  D. Rose,et al.  A Separator Theorem for Chordal Graphs , 1982 .

[11]  R. Tarjan,et al.  The analysis of a nested dissection algorithm , 1987 .

[12]  Stephen A. Vavasis,et al.  Automatic Domain Partitioning in Three Dimensions , 1991, SIAM J. Sci. Comput..

[13]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[14]  Robin Thomas,et al.  A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.

[15]  Charles H. Goldberg,et al.  Bisection of Circle Colorings , 1985 .

[16]  Gary L. Miller,et al.  A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[17]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[18]  Gary L. Miller,et al.  Density graphs and separators , 1991, SODA '91.

[19]  Gary L. Miller,et al.  Separators in two and three dimensions , 1990, STOC '90.

[20]  D. Rose,et al.  Generalized nested dissection , 1977 .

[21]  Frank Thomson Leighton,et al.  A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..