Core-sorted heavy-edge matching algorithm based on compressed storage format of graph
YU Song-nian · Computer Engineering and Applications Journal · 2011
During the coarsening phase of multilevel method,this paper introduces the concept of core and proposes the Core-Sorted Heavy-Edge Matching(CSHEM) algorithm in accordance with the compressed storage format of graph.The CSHEM algorithm not only improves previous matching schemes which are based on local information of vertex,using the global information of the finest graph core to develop its guidance role,but overcomes the defect that can only choose the Random Matching(RM) algorithm as a guide matching algorithm.Furthermore,it also presents an effective matching-based coarsening scheme that uses the CSHEM algorithm on the finest graph and the Sorted Heavy-Edge Matching(SHEM) algorithm on the coarser graphs.The scheme plays a guidance role of the core so as to make the coarser graph in accordance with the core-consistent principle.The experiment and the analysis based on ISPD98 circuit benchmark show the scheme produces encouraging performance improvement compared with those produced by the combination scheme of RM and SHEM of MeTiS that is a state-of-the-art partitioner in the literature.