Local community detection based on small cliques

DOI10.3390/a10030090zbMath1433.68297OpenAlexW2742266097MaRDI QIDQ1657050

Dorothea Wagner, Michael Hamann, Eike Röhrs

Publication date: 13 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a10030090

zbMATH Keywords

cliquecommunity detectioniterative expansionlocal community

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Uses Software

• NetworKit

Cites Work

• Unnamed Item
• Arboricity, \(h\)-index, and dynamic algorithms
• Graph clustering
• Local community detection in complex networks based on maximum cliques extension
• Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
• LOCAL COMMUNITY IDENTIFICATION IN SOCIAL NETWORKS
• The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
• Listing All Maximal Cliques in Large Sparse Real-World Graphs
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Local community detection based on small cliques