Database Paper Browser

Back to papers

Maximal D-truss Search in Dynamic Directed Graphs

Summary: Incremental/fully-dynamic community search for directed graphs using the D-truss (two directed-triangle types), with theoretical bounds on D-truss behavior under edge insertions/deletions. An order-based D-Index plus single/batch-update and fully-dynamic query algorithms yield large empirical speedups. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13071
Venue
VLDB
Year
2023
Pagerank
4.9484066e-05
Overall Rank
6,725 | 53.22%
DOI
10.14778/3598581.3598592

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 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.

Rank Cited Paper Year Venue Pagerank
283 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00029041257
1,637 Truss-based Community Search over Large Directed Graphs 2020 SIGMOD 0.0001105259
1,844 Effective Community Search over Large Spatial Graphs 2017 VLDB 0.00010341077
2,846 Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs 2019 SIGMOD 8.0234377e-05
3,321 Hierarchical Core Maintenance on Large Dynamic Graphs 2021 VLDB 7.223972e-05
3,802 Group Recommendation: Semantics and Efficiency 2009 VLDB 6.7552492e-05
5,292 Incrementalizing Graph Algorithms 2021 SIGMOD 5.5816687e-05
Previous Page 1 / 1 Next

Semantically Similar Papers