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: 11777
Venue: VLDB
Year: 2017
Pagerank: 9.1976617e-05
Overall Rank: 2,083 | 85.72%
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,069	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB	0.00012323497
1,640	Distance-generalized Core Decomposition	2019	SIGMOD	0.00010153865
2,024	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	9.2907829e-05
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,503	Accelerating Truss Decomposition on Heterogeneous Processors	2020	VLDB	7.3592701e-05
5,149	An Optimal and Progressive Approach to Online Search of Top-K Influential Communities	2018	VLDB	6.3459884e-05
6,368	Theoretically and Practically Efficient Parallel Nucleus Decomposition	2022	VLDB	5.8975125e-05
7,624	RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs	2021	VLDB	5.5805027e-05
8,623	A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition	2022	VLDB	5.3984824e-05
9,695	Parallel Algorithms for Hierarchical Nucleus Decomposition	2024	SIGMOD	5.2351259e-05
10,100	Parallel Colorful h-star Core Maintenance in Dynamic Graphs	2023	VLDB	5.1488731e-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

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
102	Truss Decomposition in Massive Networks	2012	VLDB	0.00034255289
138	Discovering Large Dense Subgraphs in Massive Graphs	2005	VLDB	0.00029823423
189	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00026114928
590	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.0001605572
793	Streaming Algorithms for k-core Decomposition	2013	VLDB	0.00013978774
825	K-Core Decomposition of Large Networks on a Single PC	2016	VLDB	0.00013779895
1,018	Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification	2012	VLDB	0.0001263063
2,323	Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms	2016	SIGMOD	8.750808e-05
2,985	Piggybacking on Social Networks	2013	VLDB	7.8919874e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,632	gCore: Exploring Cross-layer Cohesiveness in Multi-layer Graphs	2023	VLDB
2	262	On Triangulation-based Dense Neighborhood Graph Discovery	2011	VLDB
3	8,623	A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition	2022	VLDB
4	2,826	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB
5	11,256	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB
6	1,416	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB
7	9,695	Parallel Algorithms for Hierarchical Nucleus Decomposition	2024	SIGMOD
8	3,737	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD
9	2,024	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB
10	10,273	Nucleus Decomposition Revisited: An Efficient Counting-Based Approach	2026	SIGMOD