Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms

Summary: Defines (k, gamma)-truss for probabilistic graphs: maximal subgraphs where each edge has prob ≥ gamma of in ≥(k−2) triangles; provides a dynamic-programming local-decomposition algorithm. Global (k, gamma)-truss is intractable; introduces a sampling-based approximate discovery with high probability, validated on real datasets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h30c465b3b2909ea6
Venue: SIGMOD
Year: 2016
Pagerank: 9.0689711e-05
Overall Rank: 2,086 | 85.98%
DOI: 10.1145/2882903.2882913

Incoming Non-self Citations Over Time

Authors

1. Xin Huang (University of British Columbia)
2. Wei Lu (University of British Columbia)
3. Laks V.S. Lakshmanan (University of British Columbia)

BibTeX Citation

@inproceedings{huang_sigmod16,
        title = {{Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms}},
        author = {Huang, Xin and Lu, Wei and Lakshmanan, Laks V.S.},
        series = {{SIGMOD} '16},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2882903.2882913},
        url = {https://dl.acm.org/doi/10.1145/2882903.2882913},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 16 of 16 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,092	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB	0.00012072382
2,042	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	9.1416822e-05
2,119	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	9.0102885e-05
3,632	Efficient and Effective Algorithms for Clustering Uncertain Graphs	2019	VLDB	7.1494448e-05
3,794	Butterfly Counting on Uncertain Bipartite Graphs	2022	VLDB	7.0172514e-05
4,044	Efficient Bi-triangle Counting for Large Bipartite Networks	2021	VLDB	6.8334494e-05
4,091	When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks	2017	VLDB	6.8124092e-05
4,732	Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach	2022	SIGMOD	6.4461271e-05
5,720	Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs	2021	VLDB	6.018559e-05
6,651	Efficient Parallel D-core Decomposition at Scale	2024	VLDB	5.7203229e-05
7,602	Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks	2023	SIGMOD	5.4868396e-05
8,066	Efficient Star-based Truss Maintenance on Dynamic Graphs	2023	SIGMOD	5.3950351e-05
9,452	Sage: A System for Uncertain Network Analysis	2022	VLDB	5.1745448e-05
10,808	Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer	2026	VLDB	4.9793485e-05
10,809	GPU-Accelerated eta-threshold Decomposition for Uncertain Graphs	2026	VLDB	4.9793485e-05
12,166	Finding Theme Communities from Database Networks	2019	VLDB	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
100	Truss Decomposition in Massive Networks	2012	VLDB	0.00033977856
184	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00026100147
443	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB	0.00018197688
589	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.00015905948
645	Finding Maximal Cliques in Massive Networks by H*-graph	2010	SIGMOD	0.00015213733
1,063	k-Nearest Neighbors in Uncertain Graphs	2010	VLDB	0.00012208695
1,260	Distance-Constraint Reachability Computation in Uncertain Graphs	2011	VLDB	0.00011296964

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	6,061	Maximal D-truss Search in Dynamic Directed Graphs	2023	VLDB
2	184	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD
3	1,092	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB
4	2,285	Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs	2019	SIGMOD
5	1,443	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB
6	3,495	Accelerating Truss Decomposition on Heterogeneous Processors	2020	VLDB
7	10,806	Efficient Hyper-truss Decomposition over Hypergraphs	2026	VLDB
8	1,354	Truss-based Community Search over Large Directed Graphs	2020	SIGMOD
9	8,419	Truss Decomposition in Hypergraphs	2025	VLDB
10	100	Truss Decomposition in Massive Networks	2012	VLDB