A common problem in graph theory is that of dividing the vertices of a graph into two sets of prescribed size while cutting a minimum number of edges. In this paper this problem is considered as it is restricted to the class of planar graphs.Let G be a planar graph on n vertices and $s \in [0,n]$ be given. An s-partition of G is a partition of the vertex set of G into sets of size s and $n - s$. An optimals-partition is an s-partition that cuts the fewest number of edges. The main result of this paper is an algorithm that finds an optimal s-partition in time $O(b^2 n^3 2^{4.5b} )$, where b is the number of edges cut by an optimal s-partition. In particular, by letting $s = \lfloor n/2 \rfloor $ the immediate corollary that any planar graph with small $(O(\log n))$ bisection width may be bisected in polynomial time is obtained.Furthermore, suppose that a planar embedding $\hat G$ of G is also given such that the embedding of each biconnected component in $\hat G$ is at most m-outerplanar (such an embedding...
[1]
C. D. Gelatt,et al.
Optimization by Simulated Annealing
,
1983,
Science.
[2]
Brian W. Kernighan,et al.
An efficient heuristic procedure for partitioning graphs
,
1970,
Bell Syst. Tech. J..
[3]
R. Tarjan,et al.
A Separator Theorem for Planar Graphs
,
1977
.
[4]
Frank Thomson Leighton,et al.
Graph bisection algorithms with good average case behavior
,
1984,
Comb..
[5]
Brenda S. Baker,et al.
Approximation algorithms for NP-complete problems on planar graphs
,
1983,
24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[6]
Zevi Miller,et al.
A parallel algorithm for bisection width in trees
,
1988
.
[7]
Robert E. Tarjan,et al.
Efficient Planarity Testing
,
1974,
JACM.
[8]
Ravi B. Boppana,et al.
Eigenvalues and graph bisection: An average-case analysis
,
1987,
28th Annual Symposium on Foundations of Computer Science (sfcs 1987).