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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
