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 50 of 101 citing papers.

Rank Citing Paper Year Venue Pagerank
7,624 Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks 2023 SIGMOD 5.4661079e-05
8,087 Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs 2025 SIGMOD 5.3746995e-05
8,088 Efficient Star-based Truss Maintenance on Dynamic Graphs 2023 SIGMOD 5.3746503e-05
8,187 Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks 2024 VLDB 5.3652509e-05
8,339 Efficient Index for Temporal Core Queries over Bipartite Graphs 2024 VLDB 5.3353302e-05
8,395 Efficient Unsupervised Community Search with Pre-trained Graph Transformer 2024 VLDB 5.3240312e-05
8,444 Truss Decomposition in Hypergraphs 2025 VLDB 5.3148581e-05
8,670 Efficiently Counting Triangles in Large Temporal Graphs 2025 SIGMOD 5.2754888e-05
8,909 Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation 2024 VLDB 5.2369069e-05
9,004 Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery 2023 SIGMOD 5.2256037e-05
9,184 Truss-based Community Search over Streaming Directed Graphs 2024 VLDB 5.1982941e-05
9,188 Deep Overlapping Community Search via Subspace Embedding 2025 SIGMOD 5.1975376e-05
9,282 Time-Topology Analysis 2021 VLDB 5.1860131e-05
9,336 Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks 2025 VLDB 5.1783355e-05
9,421 Behavior Query Discovery in System-Generated Temporal Graphs 2016 VLDB 5.1672232e-05
9,604 Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs 2024 VLDB 5.1376962e-05
9,713 Efficient Maximum s-Bundle Search via Local Vertex Connectivity 2025 SIGMOD 5.124163e-05
9,714 Maximum k-Plex Search: An Alternated Reduction-and-Bound Method 2025 VLDB 5.124163e-05
9,768 Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs 2025 VLDB 5.115551e-05
9,908 A Flexible Framework for Query-oriented Interactive Community Search 2025 VLDB 5.0983269e-05
9,911 Parallel Algorithms for Hierarchical Nucleus Decomposition 2024 SIGMOD 5.0983269e-05
9,957 Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs 2024 VLDB 5.0910746e-05
10,142 A Comprehensive Survey and Experimental Study of Learning-based Community Search 2025 VLDB 5.0597449e-05
10,241 Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs 2020 VLDB 5.041918e-05
10,360 Parallel Colorful h-star Core Maintenance in Dynamic Graphs 2023 VLDB 5.014328e-05
10,394 Effective Structurally Similar Community Search in Large Temporal Graphs 2027 SIGMOD 4.9605343e-05
10,407 Scaling Up Density Decomposition on Massive Graphs 2027 SIGMOD 4.9605343e-05
10,413 To Learn or Not to Learn? An In-depth Empirical Analysis of Community Search Approaches 2027 SIGMOD 4.9605343e-05
10,562 Nucleus Decomposition Revisited: An Efficient Counting-Based Approach 2026 SIGMOD 4.9605343e-05
10,569 Periodic Community Search in Temporal Graphs: Time Series-based Methods 2026 SIGMOD 4.9605343e-05
10,572 Querying Cohesive Subgraphs in Temporal Graphs 2026 SIGMOD 4.9605343e-05
10,596 Zero-Redundancy Search for Bi-Components in Bipartite Graphs 2026 SIGMOD 4.9605343e-05
10,609 Scaling Up k-Clique Percolation Community Detection 2026 SIGMOD 4.9605343e-05
10,639 Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements 2026 SIGMOD 4.9605343e-05
10,684 A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs 2026 SIGMOD 4.9605343e-05
10,686 Accelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware 2026 SIGMOD 4.9605343e-05
10,708 Efficient Influential Community Search over Dynamic Graphs 2026 SIGMOD 4.9605343e-05
10,737 Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs 2026 SIGMOD 4.9605343e-05
10,783 Effective Durable Community Search in Large Temporal Graph 2026 VLDB 4.9605343e-05
10,877 Efficient Hyper-truss Decomposition over Hypergraphs 2026 VLDB 4.9605343e-05
10,884 X-Wim: Massive Parallelization of Weighted Matching in Bipartite Graphs 2026 VLDB 4.9605343e-05
11,126 Efficient Temporal Edge-Core Maintenance in Streaming Graphs 2026 VLDB 4.9605343e-05
11,169 A Local Search Approach to Efficient (k, p)-Core Maintenance 2025 SIGMOD 4.9605343e-05
11,248 Community Detection in Heterogeneous Information Networks Without Materialization 2025 SIGMOD 4.9605343e-05
11,266 SWASH: A Flexible Communication Framework with Sliding Window-Based Cache Sharing for Scalable DGNN Training 2025 SIGMOD 4.9605343e-05
11,293 Synergetic Community Search over Large Multilayer Graphs 2025 VLDB 4.9605343e-05
11,390 Effective and Efficient Community Search for Complex Network Semantics Capture: From Coarse-Grain to Fine-Grain 2025 VLDB 4.9605343e-05
11,496 Finding Time-Proximity Communities in Temporal Heterogeneous Information Networks 2025 VLDB 4.9605343e-05
11,716 MOSER: Scalable Network Motif Discovery using Serial Test 2024 VLDB 4.9605343e-05
12,046 On Analyzing Graphs with Motif-Paths 2021 VLDB 4.9605343e-05
Previous Page 2 / 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