Database Paper Browser

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
13309
Venue
VLDB
Year
2023
Pagerank
4.5698941e-05
Overall Rank
8,169 | 43.18%
DOI
10.14778/3570690.3570701

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

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