Distance-generalized Core Decomposition
Summary: Introduces the (k,h)-core, a distance-based generalization of the k-core: subgraph where each vertex has at least k others within distance h. Bounds-driven partitioning yields independent subproblems and multithreading, preserving core properties and enabling efficient approximations of distance-based dense structures (e.g., h-club). (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Francesco Bonchi
- 2. Arijit Khan
- 3. Lorenzo Severini
Incoming Citations (Sorted by Pagerank)
Showing 21 of 21 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 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
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,505 | Parallel k-Core Decomposition: Theory and Practice | 2025 | SIGMOD | 4.1905499e-05 |
| 966 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00014947141 |
| 3,323 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.2170169e-05 |
| 1,150 | K-Core Decomposition of Large Networks on a Single PC | 2016 | VLDB | 0.00013647447 |
| 6,206 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1522897e-05 |
| 6,509 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.0273291e-05 |
| 9,146 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD | 4.380727e-05 |
| 9,950 | Parallel Colorful h-star Core Maintenance in Dynamic Graphs | 2023 | VLDB | 4.236537e-05 |
| 5,302 | Distributed D-core Decomposition over Large Directed Graphs | 2022 | VLDB | 5.5746393e-05 |
| 6,145 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB | 5.1853422e-05 |