Complex network partitioning using label propagation

DOI10.1137/15M1026183MaRDI QIDQ2830633zbMATH OpenFDO

Authors George M. Slota, Kamesh Madduri, Sivasankaran Rajamanickam

Publication date 28 October 2016

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

partitioninglabel propagationparallel graph algorithmsmall-world graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10)

Recommendations

• Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
• (Semi-)External Algorithms for Graph Partitioning and Clustering
• Scalable edge partitioning
• Graph partitioning for scalable distributed graph computations
• Graph partitioning models for parallel computing

Cites work

• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
• Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• Parallel static and dynamic multi‐constraint graph partitioning
• Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
• The University of Florida sparse matrix collection
• UMPa: A multi-objective, multi-level partitioner for communication minimization

Cited in

(7)

• Improving unstructured mesh partitions for multiple criteria using mesh adjacencies
• Attributed Networks Partitioning Based on Modularity Optimization
• Scalable edge partitioning
• Partitioning a PPI network into overlapping modules constrained by high-density and periphery tracking
• Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy
• Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
• Tree-based coarsening and partitioning of complex networks

Describes a project that uses

Uses Software

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

This page was built for publication: Complex network partitioning using label propagation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830633)