Community-Search-Survey.md

Online Community Search

Possible Research Points

1. Index for dynamic graphs, for faster k-truss, k-core, distance-related, desnse local subgraph queries
2. Evaluation and Bechmark for different dense subgraph detection algorithms on parallel platforms

Researchers

• Jeffrey Xu Yu (CUHK)
• James Cheng (CUHK)

Codes

• k-Truss

  • Truss-Decomposition (from Github)

• k-Core

  • Kcore On Giraph (from Github)
  • Single document keyphrase extraction by k-core graph decompositionn (from Github)
  • Kcore with openmp (from Github) (Refer to Distributed k-Core Decomposition (TPDS 2013))

• Dense Graph Realated (From Charalampos E. Tsourakakis)

  • Some Related Code Links (Refer to The K-clique Densest Subgraph Problem (WWW 2015))
  • Optimal-Quasicliques (Refer to Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with Quality Guarantees (KDD 2013))
  • triangle-densest-subgraph-problem (Refer to The K-clique Densest Subgraph Problem (WWW 2015))
  • Scalable-Large-Near-Clique-Detection (Refer to Scalable-Large-Near-Clique-Detection (KDD 2015))