Abstract
This article presents a new method for finding initial partitioning for Fiduccia–Mattheyses algorithm that makes it possible to work out a qualitative approximate solution for the original balanced hypergraph partitioning problem. The proposed method uses geometrical properties and dimension reduction methods for metric spaces of large dimensions.
Published Version
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.
