ON BISECTING RANDOM GRAPHS
Thanh‐Tung Bui · DSpace@MIT (Massachusetts Institute of Technology) · 1983
A bisection of a graph with an even number of vertices is a partition of the vertex set into two disjoint sets of equal size. Given a bisection, the number of edges having one end in each of the two subsets of the bisection is called the size of the bisection. The bisection size of a graph is the minimum size of all possible bisections of the graph.