Name
Abstract | ||
|---|---|---|
Partitioning graphs is a common and useful operation in many areas, from parallel computing to VLSI design to sparse matrix algorithms. In this article, we introduce Mongoose, a multilevel hybrid graph partitioning algorithm and library. Building on previous work in multilevel partitioning frameworks and combinatoric approaches, we introduce novel stall-reducing and stall-free coarsening strategies, as well as an efficient hybrid algorithm leveraging (1) traditional combinatoric methods and (2) continuous quadratic programming formulations. We demonstrate how this new hybrid algorithm outperforms either strategy in isolation, and we also compare Mongoose to METIS and demonstrate its effectiveness on large and social networking (power law) graphs. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3337792 | ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE |
Keywords | DocType | Volume |
Graph partitioning, vertex matching, graph coarsening | Journal | 46 |
Issue | ISSN | Citations |
1 | 0098-3500 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| TIMOTHY A. DAVIS | 1 | 1447 | 144.19 |
| William W. Hager | 2 | 1603 | 214.67 |
| Scott P. Kolodziej | 3 | 2 | 0.70 |
| S. Nuri Yeralan | 4 | 0 | 0.34 |