Traversing a graph for identifying communities

MaRDI QIDQ3110102zbMATH OpenFDO

Authors Mahadevan Vasudevan, Narsingh Deo

Publication date 26 January 2012

zbMATH Keywords

addition phasecollege football gamescommunity detection algorithmcommunity detection algorithmscomplex networksdeletion phaseexternal density of a communitygraph transversal greedy algorithminternal density of a communityseed notesynthetic GN graphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A density set algorithm for searching communities in complex networks
• Community identification algorithm using relative edge density measure
• Community detection by using the extended modularity
• Local community detection based on small cliques
• Detecting network communities: a new systematic and efficient algorithm

This page was built for publication: Traversing a graph for identifying communities

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