Complex Network Partitioning Using Label Propagation

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)

zbMATH Keywords

partitioning; label propagation; parallel graph algorithm; small-world graph

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68W10: Parallel algorithms in computer science

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Improving Unstructured Mesh Partitions for Multiple Criteria Using Mesh Adjacencies

Uses Software

• METIS
• SparseMatrix
• symrcm
• UbiCrawler
• UMPa
• PowerGraph
• PEGASUS
• KONECT
• WebGraph

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