A greedy algorithm for neighborhood overlap-based community detection

DOI10.3390/a9010008zbMath1461.05217OpenAlexW2235644762MaRDI QIDQ1736758

Natarajan Meghanathan

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

community detectionedge betweennessmodularity scoreneighborhood overlapreal-world network

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Querying relational event graphs using colored range searching data structures ⋮ Time Windowed Data Structures for Graphs

Uses Software

• GraphBase

Cites Work

• Emergence of Scaling in Random Networks
• Complex Networks
• On Finding Graph Clusterings with Maximum Modularity
• Community structure in social and biological networks
• Fast unfolding of communities in large networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A greedy algorithm for neighborhood overlap-based community detection