Fast Hierarchy Construction for Dense Subgraphs

Summary: Fast hierarchy construction for dense subgraphs during peeling; uses disjoint-set forests to build the hierarchy on the fly. Neighborhood-visit construction avoids extra traversals, yielding speedups for k-core, k-truss, and nucleus hierarchies. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: hd3299611585e40da
Venue: VLDB
Year: 2017
Pagerank: 9.0102885e-05
Overall Rank: 2,119 | 85.76%
DOI: 10.14778/3021924.3021925

Incoming Non-self Citations Over Time

Authors

1. Ahmet Erdem Sarıyüce (Sandia National Laboratories)
2. Ali Pinar (Sandia National Laboratories)

BibTeX Citation

@article{saryuce_vldb17,
        title = {{Fast Hierarchy Construction for Dense Subgraphs}},
        author = {Sarıyüce, Ahmet Erdem and Pinar, Ali},
        journal = {PVLDB},
        series = {{VLDB} '17},
        volume = {10},
        number = {3},
        pages = {97--108},
        doi = {10.14778/3021924.3021925},
        url = {https://doi.org/10.14778/3021924.3021925},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 14 of 14 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,092	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB	0.00012072382
1,648	Distance-generalized Core Decomposition	2019	SIGMOD	9.9863775e-05
2,042	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	9.1416822e-05
2,285	Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs	2019	SIGMOD	8.6948587e-05
2,869	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB	7.9235321e-05
3,495	Accelerating Truss Decomposition on Heterogeneous Processors	2020	VLDB	7.2562279e-05
5,264	An Optimal and Progressive Approach to Online Search of Top-K Influential Communities	2018	VLDB	6.2038361e-05
5,976	Theoretically and Practically Efficient Parallel Nucleus Decomposition	2022	VLDB	5.9300103e-05
7,747	RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs	2021	VLDB	5.4601389e-05
8,772	A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition	2022	VLDB	5.2806308e-05
9,871	Parallel Algorithms for Hierarchical Nucleus Decomposition	2024	SIGMOD	5.1176637e-05
9,915	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB	5.1103839e-05
10,327	Parallel Colorful h-star Core Maintenance in Dynamic Graphs	2023	VLDB	5.0333462e-05
10,485	Nucleus Decomposition Revisited: An Efficient Counting-Based Approach	2026	SIGMOD	4.9793485e-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.00033977856
131	Discovering Large Dense Subgraphs in Massive Graphs	2005	VLDB	0.00030242586
184	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00026100147
589	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.00015905948
758	Streaming Algorithms for k-core Decomposition	2013	VLDB	0.00014188163
834	K-Core Decomposition of Large Networks on a Single PC	2016	VLDB	0.00013583208
988	Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification	2012	VLDB	0.00012660447
2,086	Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms	2016	SIGMOD	9.0689711e-05
2,905	Piggybacking on Social Networks	2013	VLDB	7.8780984e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,806	Efficient Hyper-truss Decomposition over Hypergraphs	2026	VLDB
2	10,808	Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer	2026	VLDB
3	8,772	A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition	2022	VLDB
4	2,869	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB
5	9,915	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB
6	1,443	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB
7	9,871	Parallel Algorithms for Hierarchical Nucleus Decomposition	2024	SIGMOD
8	3,789	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD
9	2,042	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB
10	10,485	Nucleus Decomposition Revisited: An Efficient Counting-Based Approach	2026	SIGMOD