Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
February 9, 2010Open Access

Detecting highly overlapping community structure by greedy clique expansion

View Full Paper
Ask AI
Bookmark
Share

Authors

CLConrad LeeLittle Rock School DistrictFRFergal ReidUniversity College DublinAMAaron F. McDaidSIB Swiss Institute of Bioinformatics

Discussion

Loading...

Member takes

Overview

Key Points

Key points are not available for this paper at this time.

Cite This Study

Lee et al. (2010) studied this question.

synapsesocial.com/papers/6a98bd877384e28de71fe956https://doi.org/10.48550/arxiv.1002.1827
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Algorithm 457: finding all cliques of an undirected graph1973 · 2,485 citations
  2. 2Comparing community structure identification2005 · 2,914 citations
  3. 3Sequential algorithm for fast clique percolation2008 · 228 citations
  4. 4Defining and identifying communities in networks2004 · 2,473 citations
  5. 5Community structure in social and biological networks2002 · 15,788 citations