DBScholar

Back to papers

Querying K-Truss Community in Large and Dynamic Graphs

Summary: Online k-truss community search for a query vertex in large, dynamic graphs. A compact index enables linear-cost k-truss search by community size and supports swift updates under frequent graph insertions/deletions; validated on real networks. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h9b0961cc949766fc
Venue
SIGMOD
Year
2014
Pagerank
0.00026383593
Overall Rank
182 | 98.79%
DOI
10.1145/2588555.2610495

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{huang_sigmod14,
        title = {{Querying K-Truss Community in Large and Dynamic Graphs}},
        author = {Huang, Xin and Cheng, Hong and Qin, Lu and Tian, Wentao and Yu, Jeffrey Xu},
        series = {{SIGMOD} '14},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2588555.2610495},
        url = {https://dl.acm.org/doi/10.1145/2588555.2610495},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 101 citing papers.

Rank Citing Paper Year Venue Pagerank
12,215 Finding Theme Communities from Database Networks 2019 VLDB 4.9605343e-05
Previous Page 3 / 3 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
96 Truss Decomposition in Massive Networks 2012 VLDB 0.00034261728
130 Discovering Large Dense Subgraphs in Massive Graphs 2005 VLDB 0.0003029792
255 On Triangulation-based Dense Neighborhood Graph Discovery 2011 VLDB 0.00022949287
274 Online Search of Overlapping Communities 2013 SIGMOD 0.00022499515
643 Finding Maximal Cliques in Massive Networks by H*-graph 2010 SIGMOD 0.00015219469
732 Streaming Algorithms for k-core Decomposition 2013 VLDB 0.00014341313
Previous Page 1 / 1 Next

Semantically Similar Papers