BIPARTITIONING INTO OVERLAPPING SETS
Abstract:
We consider the problem of partitioning a graph G = (V; E) into two sets V 1 and V 2 such that jV 1 " V 2 j is no more than an integer d, and such that P u2V 1 \GammaV 2;v2V 2 \GammaV 1 (u; v) is minimized. We show that this problem is NP-hard in general. It remains NP-hard if jV 1 j = jV 2 j, or if we insist that, for any bipartition, v 1 2 V 1 and v 2 2 V 2 for two specific nodes v 1; v 2 2 V. The problem variation in which either jV 1 j = jV 2 j or jV 1 j = k, k 2 Z, finds important applications in VLSI layout and hypertext partitioning. We examine the latter problems on special cases of graphs which have been examined in the literature for similar partitioning problems. We present polynomial time algorithms for the special cases of (a) series-parallel graphs, and (b) solid grids.
Citations
| 7716 | Computers and Intractability: A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979 |
| 364 | Combinatorical algorithms for integrated circuit layout. Applicable Theory – Lengauer - 1990 |
| 338 | Combinatorial Optimization: Networks and Matroids – Lawler - 1976 |
| 157 | Algorithms for VLSI Physical Design Automation – Sherwani - 1999 |
| 41 | Topology of series-parallel networks – Duffin - 1965 |
| 39 | The Recognition of Series-Parallel Digraphs – Valdes, Tarjan, et al. - 1982 |
| 14 | The bisection width of grid graphs – Papadimitriou, Sideri - 1990 |
| 5 | Efficient algorithms for optimization and selection on series-parallel graphs – Hassin, Tamir - 1986 |
| 3 | personal communication – Maurer - 1991 |
| 3 | Physical Design Automation of VLSI Systems", Benjamin/Cummings – Preas, Lorenzetti - 1988 |
| 1 | Sequential and parallel algorithms for partitioning simple classes of graphs – Bui, Jones - 1989 |
