Database Paper Browser

Back to papers

Truss Decomposition in Massive Networks

Summary: Truss decomposition for massive networks; the paper uses k-truss as a polynomial-time, informative core of the k-core. It strengthens the in-memory algorithm and introduces two I/O-efficient methods for out-of-core graphs, with real-data experiments showing scalability and the value of k-truss. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10523
Venue
VLDB
Year
2012
Pagerank
0.00034018471
Overall Rank
102 | 99.30%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 50 of 66 citing papers.

Rank Citing Paper Year Venue Pagerank
202 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00025608916
602 Massive Graph Triangulation 2013 SIGMOD 0.00015983188
646 Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis 2013 VLDB 0.00015514454
953 Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs 2014 VLDB 0.00013056753
976 Influential Community Search in Large Networks 2015 VLDB 0.00012949951
1,105 Approximate Closest Community Search in Networks 2016 VLDB 0.00012236171
1,128 Truss-based Community Search: a Truss-equivalence Based Indexing Approach 2017 VLDB 0.00012139459
1,232 Attribute-Driven Community Search 2017 VLDB 0.00011657126
1,509 TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph 2013 SIGMOD 0.0001060601
1,522 Finding the Maximum Clique in Massive Graphs 2017 VLDB 0.00010565271
1,566 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010397786
1,574 Local Algorithms for Hierarchical Dense Subgraph Discovery 2019 VLDB 0.00010374281
1,654 Distance-generalized Core Decomposition 2019 SIGMOD 0.00010178111
2,092 Maximum Co-located Community Search in Large Scale Social Networks 2018 VLDB 9.2522732e-05
2,142 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.1646667e-05
2,152 Fast Hierarchy Construction for Dense Subgraphs 2017 VLDB 9.1341734e-05
2,240 Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs 2019 SIGMOD 8.9487473e-05
2,331 Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms 2016 SIGMOD 8.819467e-05
2,408 Effective and Efficient Relational Community Detection and Search in Large Dynamic Heterogeneous Information Networks 2020 VLDB 8.7014297e-05
2,438 Efficient Structural Graph Clustering: An Index-Based Approach 2018 VLDB 8.644621e-05
2,784 SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs 2015 VLDB 8.1905568e-05
2,807 Hierarchical Core Maintenance on Large Dynamic Graphs 2021 VLDB 8.158882e-05
2,827 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.1346366e-05
2,894 Online Density Bursting Subgraph Detection from Temporal Graphs 2019 VLDB 8.0548719e-05
3,241 Skyline Community Search in Multi-valued Networks 2018 SIGMOD 7.6781346e-05
3,460 Finding Locally Densest Subgraphs: A Convex Programming Approach 2022 VLDB 7.470212e-05
3,634 Accelerating Truss Decomposition on Heterogeneous Processors 2020 VLDB 7.3118793e-05
3,767 Accelerating Triangle Counting on GPU 2021 SIGMOD 7.1923965e-05
3,925 Efficient Maximum k-Plex Computation over Large Sparse Graphs 2023 VLDB 7.0804695e-05
3,938 Efficient k-Clique Listing: An Edge-Oriented Branching Strategy 2024 SIGMOD 7.0733005e-05
4,266 Global Reinforcement of Social Networks: The Anchored Coreness Problem 2020 SIGMOD 6.8607427e-05
4,512 Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions 2021 SIGMOD 6.7224019e-05
4,662 Efficient Cohesive Subgraphs Detection in Parallel 2014 SIGMOD 6.6385168e-05
4,817 Efficient Maximum k-Defective Clique Computation with Improved Time Complexity 2023 SIGMOD 6.5611315e-05
5,236 Neighborhood-based Hypergraph Core Decomposition 2023 VLDB 6.3758783e-05
5,649 Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs 2021 VLDB 6.1999762e-05
5,657 Maximum k-Plex Computation: Theory and Practice 2024 SIGMOD 6.1988118e-05
6,400 Data-driven Visual Query Interfaces for Graphs: Past, Present, and (Near) Future 2022 SIGMOD 5.953377e-05
6,514 Efficient Parallel D-core Decomposition at Scale 2024 VLDB 5.9114568e-05
6,734 Theoretically and Practically Efficient Parallel Nucleus Decomposition 2022 VLDB 5.8451703e-05
6,757 Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Selection of Canned Patterns for Large Networks 2021 VLDB 5.839473e-05
6,925 Topic-based Community Search over Spatial-Social Networks 2020 VLDB 5.8073162e-05
7,029 I/O Efficient ECC Graph Decomposition via Graph Reduction 2016 VLDB 5.7754385e-05
7,345 PLAYPEN: Plug-and-Play Visual Graph Query Interfaces for Top-down and Bottom-Up Search on Large Networks 2022 SIGMOD 5.6957917e-05
7,530 RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs 2021 VLDB 5.658216e-05
7,584 Top-K Structural Diversity Search in Large Networks 2013 VLDB 5.6478565e-05
7,884 Efficient Star-based Truss Maintenance on Dynamic Graphs 2023 SIGMOD 5.5927923e-05
8,018 Efficient Triangle-Connected Truss Community Search In Dynamic Graphs 2023 VLDB 5.5638558e-05
9,255 Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs 2024 VLDB 5.3572577e-05
9,391 Efficient Maximum s-Bundle Search via Local Vertex Connectivity 2025 SIGMOD 5.3341661e-05
Previous Page 1 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
262 On Triangulation-based Dense Neighborhood Graph Discovery 2011 VLDB 0.00023104293
701 Finding Maximal Cliques in Massive Networks by H*-graph 2010 SIGMOD 0.00014954424
Previous Page 1 / 1 Next

Semantically Similar Papers