A multigrid tutorial: second edition
A multigrid tutorial: second edition
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
SIAM Journal on Scientific Computing
An algorithm for improving graph partitions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Engineering graph partitioning algorithms
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Candidate sets for alternative routes in road networks
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Advanced coarsening schemes for graph partitioning
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Optimized hybrid parallel lattice boltzmann fluid flow simulations on complex geometries
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Improve collaborative filtering through bordered block diagonal form matrices
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Localized matrix factorization for recommendation based on matrix block diagonal forms
Proceedings of the 22nd international conference on World Wide Web
Spectral graph multisection through orthogonality
Proceedings of the 4th MultiClust Workshop on Multiple Clusterings, Multi-view Data, and Multi-source Knowledge-driven Clustering
Employee workload balancing by graph partitioning
Discrete Applied Mathematics
| Hi-index | 0.00 |
We present a multi-level graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from multigrid linear solvers. Local improvement algorithms are based on max-flow min-cut computations and more localized FM searches. By combining these techniques, we obtain an algorithm that is fast on the one hand and on the other hand is able to improve the best known partitioning results for many inputs. For example, in Walshaw's well known benchmark tables we achieve 317 improvements for the tables at 1%, 3% and 5% imbalance. Moreover, in 118 out of the 295 remaining cases we have been able to reproduce the best cut in this benchmark.