A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design
DAC '93 Proceedings of the 30th international Design Automation Conference
Analysis of multilevel graph partitioning
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
IEEE Transactions on Parallel and Distributed Systems
Authoritative sources in a hyperlinked environment
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Graph Partitioning and Parallel Solvers: Has the Emperor No Clother? (Extended Abstract)
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
An evaluation of bipartitioning techniques
ARVLSI '95 Proceedings of the 16th Conference on Advanced Research in VLSI (ARVLSI'95)
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Graph partitioning for high-performance scientific simulations
Sourcebook of parallel computing
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Toward real-time image guided neurosurgery using distributed and grid computing
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Performance evaluation of a parallel sparse lattice Boltzmann solver
Journal of Computational Physics
Multilevel approaches for large-scale proteomic networks
International Journal of Computer Mathematics - Bioinformatics
Similarity cross-analysis of tag / co-tag spaces in social classification systems
Proceedings of the 2008 ACM workshop on Search in social media
Dividing Protein Interaction Networks by Growing Orthologous Articulations
PRIB '08 Proceedings of the Third IAPR International Conference on Pattern Recognition in Bioinformatics
Mining globally distributed frequent subgraphs in a single labeled graph
Data & Knowledge Engineering
Enabling high-fidelity neutron transport simulations on petascale architectures
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
A multilevel approach for learning from labeled and unlabeled data on graphs
Pattern Recognition
Divide, align and full-search for discovering conserved protein complexes
EvoBIO'08 Proceedings of the 6th European conference on Evolutionary computation, machine learning and data mining in bioinformatics
A Lagrangian approach for storage of spatio-temporal network datasets: a summary of results
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Scalable discovery of best clusters on large graphs
Proceedings of the VLDB Endowment
Triangle listing in massive networks and its applications
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A scalable eigensolver for large scale-free graphs using 2D graph partitioning
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Latency-aware data partitioning for geo-replicated online social networks
Proceedings of the Workshop on Posters and Demos Track
Improving functional modularity in protein-protein interactions graphs using hub-induced subgraphs
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Community detection via heterogeneous interaction analysis
Data Mining and Knowledge Discovery
Clustered embedding of massive social networks
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Generative Models for Evolutionary Clustering
ACM Transactions on Knowledge Discovery from Data (TKDD)
A parallel graph partitioning algorithm to speed up the large-scale distributed graph mining
Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
Engineering graph partitioning algorithms
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Efficient Entity Translation Mining: A Parallelized Graph Alignment Approach
ACM Transactions on Information Systems (TOIS)
Triangle listing in massive networks
ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on the Best of SIGKDD 2011
PowerGraph: distributed graph-parallel computation on natural graphs
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
Finding the optimal path over multi-cost graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
GraphX: a resilient distributed graph system on Spark
First International Workshop on Graph Data Management Experiences and Systems
GraphBuilder: scalable graph ETL framework
First International Workshop on Graph Data Management Experiences and Systems
Scalable matrix computations on large scale-free graphs using 2D graph partitioning
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Graph partitioning is an enabling technology for parallel processing as it allows for the effective decomposition of unstructured computations whose data dependencies correspond to a large sparse and irregular graph. Even though the problem of computing high-quality partitionings of graphs arising in scientific computations is to a large extent well-understood, this is far from being true for emerging HPC applications whose underlying computation involves graphs whose degree distribution follows a powerlaw curve. This paper presents new multilevel graph partitioning algorithms that are specifically designed for partitioning such graphs. It presents new clustering-based coarsening schemes that identify and collapse together groups of vertices that are highly connected. An experimental evaluation of these schemes on 10 different graphs show that the proposed algorithms consistently and significantly outperform existing state-of-the-art approaches.