Neighborhood-based Hypergraph Core Decomposition
Summary: Proposes neighborhood-based core decomposition: hierarchical neighborhood-cohesive subhypergraphs that avoid lossy clique/bipartite reductions and correct degree-core's ignorance of neighborhood size. Presents Peel, E-Peel and scalable Local-core(P) (27M nodes,17M hyperedges in-memory in 91s) and a combined (neighborhood,degree)-core via Local-core+Peel, showing superior results for disease intervention and densest-subhypergraph extraction. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,146 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD | 4.3849295e-05 |
| 9,482 | MCR-Tree: An Efficient Index for Multi-dimensional Core Search | 2024 | SIGMOD | 4.3341665e-05 |
| 9,484 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 4.3341665e-05 |
| 10,072 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD | 4.1945683e-05 |
| 10,596 | Truss Decomposition in Hypergraphs | 2025 | VLDB | 4.1945683e-05 |
| 10,670 | X-Blossom: Massive Parallelization of Graph Maximum Matching | 2025 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 108 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048300163 |
| 966 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00014960672 |
| 1,150 | K-Core Decomposition of Large Networks on a Single PC | 2016 | VLDB | 0.00013657353 |
| 1,836 | Distance-generalized Core Decomposition | 2019 | SIGMOD | 0.00010365753 |
| 2,785 | Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs | 2013 | VLDB | 8.1286814e-05 |
| 2,909 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 7.9305767e-05 |
| 4,895 | Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner | 2017 | VLDB | 5.8476644e-05 |
| 5,478 | MEGA: Multi-View Semi-Supervised Clustering of Hypergraphs | 2020 | VLDB | 5.4851612e-05 |
| 5,518 | Hypergraph Motifs: Concepts, Algorithms, and Discoveries | 2020 | VLDB | 5.4621935e-05 |
| 6,141 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB | 5.1903263e-05 |
| 6,450 | On A Quest for Combating Filter Bubbles and Misinformation | 2022 | SIGMOD | 5.0583557e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,871 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB | 4.1945683e-05 |
| 1,150 | K-Core Decomposition of Large Networks on a Single PC | 2016 | VLDB | 0.00013657353 |
| 966 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00014960672 |
| 1,836 | Distance-generalized Core Decomposition | 2019 | SIGMOD | 0.00010365753 |
| 9,951 | Parallel Colorful h-star Core Maintenance in Dynamic Graphs | 2023 | VLDB | 4.2405999e-05 |
| 6,513 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.0321577e-05 |
| 5,298 | Distributed D-core Decomposition over Large Directed Graphs | 2022 | VLDB | 5.5799987e-05 |
| 2,039 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB | 9.7061003e-05 |
| 6,141 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB | 5.1903263e-05 |
| 9,146 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD | 4.3849295e-05 |