Complex Network Partitioning Using Label Propagation
From MaRDI portal
Publication:2830633
DOI10.1137/15M1026183zbMath1386.68214MaRDI QIDQ2830633
George Slota, Sivasankaran Rajamanickam, Kamesh Madduri
Publication date: 28 October 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
- The university of Florida sparse matrix collection
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- Parallel static and dynamic multi‐constraint graph partitioning
- Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies