DBScholar

Back to papers

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
5166
Venue
SIGMOD
Year
2016
Pagerank
8.750808e-05
Overall Rank
2,323 | 84.07%
DOI
10.1145/2882903.2882913

Incoming Non-self Citations Over Time

Authors

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

Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers