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: h9057a19c3e03a37b
Venue: VLDB
Year: 2019
Pagerank: 0.00010630508
Overall Rank: 1,444 | 90.30%
DOI: 10.14778/3275536.3275540
PDF: Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

Authors

1. Ahmet Erdem Sarıyüce (State University of New York at Buffalo)
2. C. Seshadhri (University of California)
3. Ali Pinar (Sandia National Laboratories)

BibTeX Citation

@article{saryuce_vldb19,
        title = {{Local Algorithms for Hierarchical Dense Subgraph Discovery}},
        author = {Sarıyü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,017	RapidMatch: A Holistic Approach to Subgraph Query Processing	2021	VLDB	9.1788573e-05
2,044	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	9.1373547e-05
2,288	Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs	2019	SIGMOD	8.6907426e-05
3,376	Mining Bursting Core in Large Temporal Graphs	2022	VLDB	7.3556068e-05
3,495	Accelerating Truss Decomposition on Heterogeneous Processors	2020	VLDB	7.2527929e-05
3,868	Distributed D-core Decomposition over Large Directed Graphs	2022	VLDB	6.9548387e-05
5,631	Efficient Core Maintenance in Large Bipartite Graphs	2023	SIGMOD	6.0563927e-05
5,721	Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs	2021	VLDB	6.0157099e-05
5,976	Theoretically and Practically Efficient Parallel Nucleus Decomposition	2022	VLDB	5.9272031e-05
6,655	Efficient Parallel D-core Decomposition at Scale	2024	VLDB	5.717615e-05
7,284	Towards Distributed Bitruss Decomposition on Bipartite Graphs	2022	VLDB	5.5639722e-05
7,753	RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs	2021	VLDB	5.4575542e-05
7,814	A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery	2024	SIGMOD	5.4469653e-05
8,072	Efficient Star-based Truss Maintenance on Dynamic Graphs	2023	SIGMOD	5.3924812e-05
8,863	MCR-Tree: An Efficient Index for Multi-dimensional Core Search	2024	SIGMOD	5.2616231e-05
9,878	Parallel Algorithms for Hierarchical Nucleus Decomposition	2024	SIGMOD	5.115241e-05
9,922	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB	5.1079647e-05
10,208	Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs	2020	VLDB	5.0586451e-05
10,391	On Sketching Trimmed Statistics	2026	PODS	4.9769913e-05
10,496	Nucleus Decomposition Revisited: An Efficient Counting-Based Approach	2026	SIGMOD	4.9769913e-05
12,132	Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice	2020	VLDB	4.9769913e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
100	Truss Decomposition in Massive Networks	2012	VLDB	0.0003396253
131	Discovering Large Dense Subgraphs in Massive Graphs	2005	VLDB	0.00030236369
184	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00026097449
274	3-HOP: A High-Compression Indexing Scheme for Reachability Query	2009	SIGMOD	0.00022480767
834	K-Core Decomposition of Large Networks on a Single PC	2016	VLDB	0.00013576778
988	Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification	2012	VLDB	0.00012654453
2,905	Piggybacking on Social Networks	2013	VLDB	7.874369e-05
4,758	Efficient Cohesive Subgraphs Detection in Parallel	2014	SIGMOD	6.4293075e-05
5,604	Ego-net Community Mining Applied to Friend Suggestion	2016	VLDB	6.0671173e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	4,315	Neighborhood-based Hypergraph Core Decomposition	2023	VLDB
2	10,334	Parallel Colorful h-star Core Maintenance in Dynamic Graphs	2023	VLDB
3	100	Truss Decomposition in Massive Networks	2012	VLDB
4	10,818	Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer	2026	VLDB
5	10,496	Nucleus Decomposition Revisited: An Efficient Counting-Based Approach	2026	SIGMOD
6	9,922	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB
7	8,428	Truss Decomposition in Hypergraphs	2025	VLDB
8	2,121	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB
9	9,878	Parallel Algorithms for Hierarchical Nucleus Decomposition	2024	SIGMOD
10	5,721	Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs	2021	VLDB