Maximal D-truss Search in Dynamic Directed Graphs
Summary: Introduces dynamic community search for directed graphs via D-truss, defined over two directed-triangle types. Derives update bounds and develops D-Index-based batch/fully dynamic algorithms, substantially outperforming prior work. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Anxin Tian (Hong Kong University of Science and Technology)
- 2. Alexander Zhou (Hong Kong University of Science and Technology)
- 3. Yue Wang (Shenzhen University)
- 4. Lei Chen (Hong Kong University of Science and Technology)
BibTeX Citation
@article{tian_vldb23,
title = {{Maximal D-truss Search in Dynamic Directed Graphs}},
author = {Tian, Anxin and Zhou, Alexander and Wang, Yue and Chen, Lei},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {9},
pages = {2199--2211},
doi = {10.14778/3598581.3598592},
url = {https://doi.org/10.14778/3598581.3598592},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,617 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.8212982e-05 |
| 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB | 5.4784885e-05 |
| 8,504 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 5.4132367e-05 |
| 8,991 | Truss-based Community Search over Streaming Directed Graphs | 2024 | VLDB | 5.3377754e-05 |
| 10,273 | Nucleus Decomposition Revisited: An Efficient Counting-Based Approach | 2026 | SIGMOD | 5.093636e-05 |
| 10,609 | Efficient Temporal Edge-Core Maintenance in Streaming Graphs | 2026 | VLDB | 5.093636e-05 |
| 10,857 | Truss Decomposition in Hypergraphs | 2025 | VLDB | 5.093636e-05 |
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 |
|---|---|---|---|---|
| 189 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026114928 |
| 1,328 | Truss-based Community Search over Large Directed Graphs | 2020 | SIGMOD | 0.00011140898 |
| 1,378 | Effective Community Search over Large Spatial Graphs | 2017 | VLDB | 0.00010971508 |
| 2,243 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD | 8.8813183e-05 |
| 2,826 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 8.0865974e-05 |
| 3,608 | Group Recommendation: Semantics and Efficiency | 2009 | VLDB | 7.2609441e-05 |
| 4,443 | Incrementalizing Graph Algorithms | 2021 | SIGMOD | 6.7004839e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,106 | Maximum Co-located Community Search in Large Scale Social Networks | 2018 | VLDB |
| 2 | 10,367 | Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements | 2026 | SIGMOD |
| 3 | 5,408 | Reliable Community Search in Dynamic Networks | 2022 | VLDB |
| 4 | 11,198 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 5 | 1,069 | Truss-based Community Search: a Truss-equivalence Based Indexing Approach | 2017 | VLDB |
| 6 | 10,448 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD |
| 7 | 8,991 | Truss-based Community Search over Streaming Directed Graphs | 2024 | VLDB |
| 8 | 7,408 | Efficient Triangle-Connected Truss Community Search In Dynamic Graphs | 2023 | VLDB |
| 9 | 189 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD |
| 10 | 1,328 | Truss-based Community Search over Large Directed Graphs | 2020 | SIGMOD |