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: 11590
Venue: VLDB
Year: 2017
Pagerank: 8.6114467e-05
Overall Rank: 2,516 | 82.52%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Ahmet Erdem Sariyüce
2. Ali Pinar

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,529	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB	0.00011484853
1,837	Distance-generalized Core Decomposition	2019	SIGMOD	0.00010355705
2,852	Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs	2019	SIGMOD	8.0158741e-05
2,913	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9229304e-05
3,323	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB	7.2170169e-05
3,976	Accelerating Truss Decomposition on Heterogeneous Processors	2020	VLDB	6.5694893e-05
5,656	An Optimal and Progressive Approach to Online Search of Top-K Influential Communities	2018	VLDB	5.3876479e-05
6,882	Theoretically and Practically Efficient Parallel Nucleus Decomposition	2022	VLDB	4.8923998e-05
7,806	RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs	2021	VLDB	4.6421951e-05
8,630	A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition	2022	VLDB	4.4765914e-05
9,950	Parallel Colorful h-star Core Maintenance in Dynamic Graphs	2023	VLDB	4.236537e-05
10,950	Parallel Algorithms for Hierarchical Nucleus Decomposition	2024	SIGMOD	4.1905499e-05
11,051	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB	4.1905499e-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
57	Discovering Large Dense Subgraphs in Massive Graphs	2005	VLDB	0.00065421423
106	Truss Decomposition in Massive Networks	2012	VLDB	0.00048373761
284	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00029014359
734	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.00017419528
966	Streaming Algorithms for k-core Decomposition	2013	VLDB	0.00014947141
1,029	Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification	2012	VLDB	0.00014568714
1,150	K-Core Decomposition of Large Networks on a Single PC	2016	VLDB	0.00013647447
2,685	Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms	2016	SIGMOD	8.314724e-05
3,406	Piggybacking on Social Networks	2013	VLDB	7.1298853e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,134	A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs	2026	SIGMOD	4.1905499e-05
8,686	gCore: Exploring Cross-layer Cohesiveness in Multi-layer Graphs	2023	VLDB	4.4623723e-05
110	On Triangulation-based Dense Neighborhood Graph Discovery	2011	VLDB	0.00047955011
8,630	A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition	2022	VLDB	4.4765914e-05
3,323	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB	7.2170169e-05
11,051	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB	4.1905499e-05
2,043	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB	9.6970812e-05
10,950	Parallel Algorithms for Hierarchical Nucleus Decomposition	2024	SIGMOD	4.1905499e-05
4,341	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD	6.268429e-05
2,913	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9229304e-05