Given a graph G=(V,E), graph bisection is the problem of finding a partition of the vertex set V into two equal-sized subsets V I and V 2 so that the number of edges between them is minimized. This problem has important applications in circuit wtitioning, testing, VLSI design and other network-related problems that apply the divide-and-conquer strategy. We mroduce a new heuristic approach, called Iterative Compacnon (IC), which employees a node degree based matching and uerative graph compaction. This gives a significant improvement over the performance of known bisection algorithms in both time and quality of the results.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.