Dense and sparse graph partition

DOI10.1016/j.dam.2012.06.004zbMath1252.05172OpenAlexW2139077607MaRDI QIDQ714027

Julien Moncel, Nadia Brauner, Julien Darlay

Publication date: 19 October 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.06.004

zbMATH Keywords

complexityalgorithmscommunity detectiongraph partition

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Density (toughness, etc.) (05C42)

Related Items (2)

Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks ⋮ Parliament seating assignment problems

Uses Software

• Graclus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph clustering
• NP-hardness of Euclidean sum-of-squares clustering
• Clustering on trees
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A faster algorithm for betweenness centrality*
• List Partitions
• SOFSEM 2006: Theory and Practice of Computer Science
• The dense \(k\)-subgraph problem

This page was built for publication: Dense and sparse graph partition