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.00048373761
Overall Rank
106 | 99.27%
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
284 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00029014359
588 Massive Graph Triangulation 2013 SIGMOD 0.00019588834
734 Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis 2013 VLDB 0.00017419528
865 Finding the Maximum Clique in Massive Graphs 2017 VLDB 0.00015775653
1,170 Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs 2014 VLDB 0.00013526297
1,256 Influential Community Search in Large Networks 2015 VLDB 0.00013009097
1,529 Truss-based Community Search: a Truss-equivalence Based Indexing Approach 2017 VLDB 0.00011484853
1,548 Approximate Closest Community Search in Networks 2016 VLDB 0.0001141271
1,645 Attribute-Driven Community Search 2017 VLDB 0.00011027616
1,837 Distance-generalized Core Decomposition 2019 SIGMOD 0.00010355705
1,879 TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph 2013 SIGMOD 0.00010227906
2,043 Local Algorithms for Hierarchical Dense Subgraph Discovery 2019 VLDB 9.6970812e-05
2,172 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 9.37776e-05
2,440 Efficient Structural Graph Clustering: An Index-Based Approach 2018 VLDB 8.8166939e-05
2,516 Fast Hierarchy Construction for Dense Subgraphs 2017 VLDB 8.6114467e-05
2,608 Maximum Co-located Community Search in Large Scale Social Networks 2018 VLDB 8.4587487e-05
2,685 Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms 2016 SIGMOD 8.314724e-05
2,718 SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs 2015 VLDB 8.2356874e-05
2,726 Effective and Efficient Relational Community Detection and Search in Large Dynamic Heterogeneous Information Networks 2020 VLDB 8.2266116e-05
2,799 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 8.109137e-05
2,852 Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs 2019 SIGMOD 8.0158741e-05
3,274 Global Reinforcement of Social Networks: The Anchored Coreness Problem 2020 SIGMOD 7.2886717e-05
3,323 Hierarchical Core Maintenance on Large Dynamic Graphs 2021 VLDB 7.2170169e-05
3,369 Online Density Bursting Subgraph Detection from Temporal Graphs 2019 VLDB 7.1656755e-05
3,488 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 7.0460627e-05
3,579 Finding Locally Densest Subgraphs: A Convex Programming Approach 2022 VLDB 6.9461197e-05
3,608 Skyline Community Search in Multi-valued Networks 2018 SIGMOD 6.9241653e-05
3,976 Accelerating Truss Decomposition on Heterogeneous Processors 2020 VLDB 6.5694893e-05
4,085 Efficient Maximum k-Plex Computation over Large Sparse Graphs 2023 VLDB 6.4580586e-05
4,146 Accelerating Triangle Counting on GPU 2021 SIGMOD 6.4065776e-05
4,266 Efficient k-Clique Listing: An Edge-Oriented Branching Strategy 2024 SIGMOD 6.3006582e-05
4,737 Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions 2021 SIGMOD 5.9529218e-05
4,927 Efficient Cohesive Subgraphs Detection in Parallel 2014 SIGMOD 5.8181623e-05
4,984 Efficient Maximum k-Defective Clique Computation with Improved Time Complexity 2023 SIGMOD 5.7811667e-05
5,599 Neighborhood-based Hypergraph Core Decomposition 2023 VLDB 5.4164926e-05
5,709 Maximum k-Plex Computation: Theory and Practice 2024 SIGMOD 5.3622436e-05
6,145 Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs 2021 VLDB 5.1853422e-05
6,509 Efficient Parallel D-core Decomposition at Scale 2024 VLDB 5.0273291e-05
6,515 Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Selection of Canned Patterns for Large Networks 2021 VLDB 5.0270814e-05
6,609 Data-driven Visual Query Interfaces for Graphs: Past, Present, and (Near) Future 2022 SIGMOD 4.9908785e-05
6,872 PLAYPEN: Plug-and-Play Visual Graph Query Interfaces for Top-down and Bottom-Up Search on Large Networks 2022 SIGMOD 4.8963347e-05
6,882 Theoretically and Practically Efficient Parallel Nucleus Decomposition 2022 VLDB 4.8923998e-05
7,267 Top-K Structural Diversity Search in Large Networks 2013 VLDB 4.7771943e-05
7,287 Topic-based Community Search over Spatial-Social Networks 2020 VLDB 4.7697047e-05
7,343 I/O Efficient ECC Graph Decomposition via Graph Reduction 2016 VLDB 4.7511136e-05
7,806 RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs 2021 VLDB 4.6421951e-05
8,017 Efficient Star-based Truss Maintenance on Dynamic Graphs 2023 SIGMOD 4.6014683e-05
8,171 Efficient Triangle-Connected Truss Community Search In Dynamic Graphs 2023 VLDB 4.5655127e-05
9,246 Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs 2024 VLDB 4.3648789e-05
9,396 Efficient Maximum s-Bundle Search via Local Vertex Connectivity 2025 SIGMOD 4.3399748e-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
110 On Triangulation-based Dense Neighborhood Graph Discovery 2011 VLDB 0.00047955011
682 Finding Maximal Cliques in Massive Networks by H*-graph 2010 SIGMOD 0.0001816451
Previous Page 1 / 1 Next

Semantically Similar Papers