Abstract
Combined with the application of circuit partitioning, the hyper-graph model of ISPD98 benchmark is built on the weighted hyper-graph and the formal description of weighted hyper-graph partitioning problem is presented. The weighted hyper-graph partitioning algorithms based on the multi-level method is described. We also propose the matching strategy based on the core property of vertex which improves previous matching strategies based on the local information of vertex. Furthermore, we extend the core notion of graph to the hyper-graph, propose the core notion of hyper-graph and give its formal description. Finally, we carry out the comparative experiment between the degree and core of vertex based on 18 hyper-graphs of ISPD98 benchmark. The experiment and analysis show the core of vertex can more nearly reflects the importance of vertex in the coarse hyper-graph of each level than the degree of vertex.
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.
