Abstract
This paper describes a new partitioning algorithm, BISECT, which is an extension of the Fiduccia-Mattheyses (FM) algorithm that recursively combines clustering and iterative improvement. A post analysis of sequences of moves in one pass generates disjoint subsets of nodes for clustering. After clustering BISECT is applied again on the compacted circuit. BISECT is stabler, achieves results that can be up to 73 times better than FM, and runs in linear time under suitably mild assumptions. BISECT also performs well in comparison with the Kernighan-Lin algorithm and simulated annealing. The empirical results show that BISECT is stable and is not very sensitive to the initial partition. For many random sparse graphs, BISECT achieves 0-cut bisections (balanced partitions). >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
