Querying k-truss community in large and dynamic graphs

By Xin Huang, Hong Cheng, Lu Qin, Wentao Tian, Jeffrey Xu Yu. SIGMOD Conference, 2014

513 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Information Systems, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/fcf2fde78b856eca9b79adb201935e36cd206985

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Xuemin Lin
2. Lu Qin
3. W. Zhang
4. Reynold Cheng
5. Jiafeng Hu
6. Yixiang Fang
7. Siqiang Luo
8. Xin Huang

In Information Systems

1. Lu Qin
2. Reynold Cheng
3. Xuemin Lin
4. Yixiang Fang
5. Xin Huang
6. Y. Zhang

In Statistical and Nonlinear Physics

1. Lu Qin
2. W. Zhang
3. Reynold Cheng
4. Jiafeng Hu
5. Xuemin Lin
6. Yixiang Fang
7. Siqiang Luo
8. Xin Huang

Citations in the corpus

• A survey of community search over big graphs (2019, methodology): “Based on the TCP-index, an efficient query processing algorithm is developed for CTC search.”
• Effective Community Search for Large Attributed Graphs (2016, methodology): “Non-attributed [22, 11] [26, 5, 4, 15, 18] Attributed [34, 21, 20, 29, 23] ACQ (This paper)”