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: h4060b042ad2a133e
Venue: VLDB
Year: 2012
Pagerank: 0.00033977856
Overall Rank: 100 | 99.33%
DOI: 10.14778/2315356.2315361

Incoming Non-self Citations Over Time

Authors

1. Jia Wang (Chinese University of Hong Kong)
2. James Cheng (Nanyang Technological University)

BibTeX Citation

@article{wang_vldb12,
        title = {{Truss Decomposition in Massive Networks}},
        author = {Wang, Jia and Cheng, James},
        journal = {PVLDB},
        series = {{VLDB} '12},
        volume = {5},
        number = {9},
        pages = {812--823},
        doi = {10.14778/2315356.2315361},
        url = {https://doi.org/10.14778/2315356.2315361},
        year = {2012}
}

Incoming Citations (Sorted by Pagerank)

Showing 50 of 68 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
184	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00026100147
589	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.00015905948
600	Massive Graph Triangulation	2013	SIGMOD	0.00015740352
959	Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs	2014	VLDB	0.00012854625
1,007	Influential Community Search in Large Networks	2015	VLDB	0.00012556573
1,092	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB	0.00012072382
1,129	Approximate Closest Community Search in Networks	2016	VLDB	0.00011903608
1,261	Attribute-Driven Community Search	2017	VLDB	0.00011289708
1,443	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB	0.00010635542
1,507	Finding the Maximum Clique in Massive Graphs	2017	VLDB	0.00010450256
1,563	TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph	2013	SIGMOD	0.00010224369
1,572	Scalable Subgraph Enumeration in MapReduce	2015	VLDB	0.00010197978
1,648	Distance-generalized Core Decomposition	2019	SIGMOD	9.9863775e-05
2,086	Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms	2016	SIGMOD	9.0689711e-05
2,101	DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine	2016	SIGMOD	9.0476814e-05
2,119	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	9.0102885e-05
2,146	Maximum Co-located Community Search in Large Scale Social Networks	2018	VLDB	8.9595369e-05
2,285	Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs	2019	SIGMOD	8.6948587e-05
2,332	Effective and Efficient Relational Community Detection and Search in Large Dynamic Heterogeneous Information Networks	2020	VLDB	8.6267865e-05
2,468	GPU-Accelerated Subgraph Enumeration on Partitioned Graphs	2020	SIGMOD	8.4178183e-05
2,540	Efficient Structural Graph Clustering: An Index-Based Approach	2018	VLDB	8.3274854e-05
2,836	SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs	2015	VLDB	7.9547269e-05
2,869	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB	7.9235321e-05
2,946	Online Density Bursting Subgraph Detection from Temporal Graphs	2019	VLDB	7.8250028e-05
3,064	Finding Locally Densest Subgraphs: A Convex Programming Approach	2022	VLDB	7.6898682e-05
3,189	Efficient Maximum k-Plex Computation over Large Sparse Graphs	2023	VLDB	7.5528776e-05
3,314	Accelerating Triangle Counting on GPU	2021	SIGMOD	7.4380767e-05
3,318	Skyline Community Search in Multi-valued Networks	2018	SIGMOD	7.4324312e-05
3,495	Accelerating Truss Decomposition on Heterogeneous Processors	2020	VLDB	7.2562279e-05
3,610	Efficient k-Clique Listing: An Edge-Oriented Branching Strategy	2024	SIGMOD	7.1643588e-05
3,860	Efficient Maximum k-Defective Clique Computation with Improved Time Complexity	2023	SIGMOD	6.9663663e-05
3,875	Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions	2021	SIGMOD	6.9536357e-05
4,314	Neighborhood-based Hypergraph Core Decomposition	2023	VLDB	6.6695257e-05
4,422	Global Reinforcement of Social Networks: The Anchored Coreness Problem	2020	SIGMOD	6.6060521e-05
4,755	Efficient Cohesive Subgraphs Detection in Parallel	2014	SIGMOD	6.4323525e-05
5,277	Top-K Structural Diversity Search in Large Networks	2013	VLDB	6.1999805e-05
5,585	Maximum k-Plex Computation: Theory and Practice	2024	SIGMOD	6.0761018e-05
5,720	Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs	2021	VLDB	6.018559e-05
5,976	Theoretically and Practically Efficient Parallel Nucleus Decomposition	2022	VLDB	5.9300103e-05
6,211	I/O Efficient ECC Graph Decomposition via Graph Reduction	2016	VLDB	5.8487355e-05
6,566	Data-driven Visual Query Interfaces for Graphs: Past, Present, and (Near) Future	2022	SIGMOD	5.7470663e-05
6,651	Efficient Parallel D-core Decomposition at Scale	2024	VLDB	5.7203229e-05
6,978	Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Selection of Canned Patterns for Large Networks	2021	VLDB	5.6293636e-05
7,150	Topic-based Community Search over Spatial-Social Networks	2020	VLDB	5.5986232e-05
7,547	Efficient Triangle-Connected Truss Community Search In Dynamic Graphs	2023	VLDB	5.4981692e-05
7,616	PLAYPEN: Plug-and-Play Visual Graph Query Interfaces for Top-down and Bottom-Up Search on Large Networks	2022	SIGMOD	5.4833642e-05
7,747	RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs	2021	VLDB	5.4601389e-05
8,066	Efficient Star-based Truss Maintenance on Dynamic Graphs	2023	SIGMOD	5.3950351e-05
8,318	Efficient Index for Temporal Core Queries over Bipartite Graphs	2024	VLDB	5.3555659e-05
8,419	Truss Decomposition in Hypergraphs	2025	VLDB	5.3350162e-05

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
265	On Triangulation-based Dense Neighborhood Graph Discovery	2011	VLDB	0.00022748633
645	Finding Maximal Cliques in Massive Networks by H*-graph	2010	SIGMOD	0.00015213733

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	184	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD
2	758	Streaming Algorithms for k-core Decomposition	2013	VLDB
3	4,755	Efficient Cohesive Subgraphs Detection in Parallel	2014	SIGMOD
4	10,806	Efficient Hyper-truss Decomposition over Hypergraphs	2026	VLDB
5	1,443	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB
6	1,354	Truss-based Community Search over Large Directed Graphs	2020	SIGMOD
7	1,092	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB
8	2,086	Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms	2016	SIGMOD
9	3,495	Accelerating Truss Decomposition on Heterogeneous Processors	2020	VLDB
10	8,419	Truss Decomposition in Hypergraphs	2025	VLDB