Complex network partitioning using label propagation

DOI10.1137/15M1026183zbMATH Open1386.68214MaRDI QIDQ2830633FDOQ2830633

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)

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

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)

Cites Work

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

Cited In (7)

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

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)