DBScholar

Back to papers

Local Algorithms for Hierarchical Dense Subgraph Discovery

Summary: Local, parallel algorithms for core, truss, and nucleus decompositions enable hierarchical dense-subgraph discovery without synchronization. Extends h-index to higher-order decompositions with convergence bounds, enabling local, scalable approximations. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12164
Venue
VLDB
Year
2019
Pagerank
0.00010839488
Overall Rank
1,416 | 90.29%
DOI
10.14778/3275536.3275540

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{saryuce_vldb19,
        title = {{Local Algorithms for Hierarchical Dense Subgraph Discovery}},
        author = {Sarıyüce, Ahmet Erdem and Seshadhri, C. and Pinar, Ali},
        journal = {PVLDB},
        series = {{VLDB} '19},
        volume = {12},
        number = {1},
        pages = {43--56},
        doi = {10.14778/3275536.3275540},
        url = {https://doi.org/10.14778/3275536.3275540},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 21 of 21 citing papers.

Rank Citing Paper Year Venue Pagerank
2,024 Efficient Algorithms for Densest Subgraph Discovery 2019 VLDB 9.2907829e-05
2,035 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2787188e-05
2,243 Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs 2019 SIGMOD 8.8813183e-05
3,337 Mining Bursting Core in Large Temporal Graphs 2022 VLDB 7.5072753e-05
3,503 Accelerating Truss Decomposition on Heterogeneous Processors 2020 VLDB 7.3592701e-05
3,855 Distributed D-core Decomposition over Large Directed Graphs 2022 VLDB 7.0712144e-05
5,674 Efficient Core Maintenance in Large Bipartite Graphs 2023 SIGMOD 6.1255689e-05
5,697 Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs 2021 VLDB 6.1174514e-05
6,368 Theoretically and Practically Efficient Parallel Nucleus Decomposition 2022 VLDB 5.8975125e-05
6,617 Efficient Parallel D-core Decomposition at Scale 2024 VLDB 5.8212982e-05
7,144 Towards Distributed Bitruss Decomposition on Bipartite Graphs 2022 VLDB 5.6910663e-05
7,624 RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs 2021 VLDB 5.5805027e-05
8,011 Efficient Star-based Truss Maintenance on Dynamic Graphs 2023 SIGMOD 5.5074939e-05
8,687 MCR-Tree: An Efficient Index for Multi-dimensional Core Search 2024 SIGMOD 5.3849387e-05
9,519 A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery 2024 SIGMOD 5.2562724e-05
9,695 Parallel Algorithms for Hierarchical Nucleus Decomposition 2024 SIGMOD 5.2351259e-05
10,011 Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs 2020 VLDB 5.1772034e-05
10,162 On Sketching Trimmed Statistics 2026 PODS 5.093636e-05
10,273 Nucleus Decomposition Revisited: An Efficient Counting-Based Approach 2026 SIGMOD 5.093636e-05
11,256 Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs 2024 VLDB 5.093636e-05
11,825 Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice 2020 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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