DBScholar

Back to papers

Efficient Triangle-Connected Truss Community Search In Dynamic Graphs

Summary: Revisit k-TTC search in dynamic graphs: prove a diameter upper bound for k-TTC (≤ ⌊2n/(k+1)⌋) and formalize triangle connectivity via the novel concepts of partial class and truss-precedence. Build EquiTree, a compact index with efficient construction/maintenance achieving up to two-orders-of-magnitude query speedups. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13497
Venue
VLDB
Year
2023
Pagerank
5.6243648e-05
Overall Rank
7,408 | 49.18%
DOI
10.14778/3570690.3570701

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{xu_vldb23,
        title = {{Efficient Triangle-Connected Truss Community Search In Dynamic Graphs}},
        author = {Xu, Tianyang and Lu, Zhao and Zhu, Yuanyuan},
        journal = {PVLDB},
        series = {{VLDB} '23},
        volume = {16},
        number = {3},
        pages = {519--531},
        doi = {10.14778/3570690.3570701},
        url = {https://doi.org/10.14778/3570690.3570701},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 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