On the public citation graph

Accelerating Core Decomposition in Billion-Scale Hypergraphs

0 signed · 55 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s00778-016-0423-8openalex-snapshot
Incremental k-core decomposition: algorithms and evaluation
inferredcites →https://doi.org/10.1007/s10618-023-00956-2openalex-snapshot
Hypercore decomposition for non-fragile hyperedges: concepts, algorithms, observations, and applications
inferredcites →https://doi.org/10.1016/j.chaos.2023.113645openalex-snapshot
(k,q) -core decomposition of hypergraphs
inferredcites →https://doi.org/10.1016/j.ins.2018.07.029openalex-snapshot
Multiobjective e-commerce recommendations based on hypergraph ranking
inferredcites →https://doi.org/10.1016/j.physa.2011.09.017openalex-snapshot
Identifying influential nodes in complex networks
inferredcites →https://doi.org/10.1016/j.physrep.2009.11.002openalex-snapshot
Community detection in graphs
inferredcites →https://doi.org/10.1073/pnas.0507655102openalex-snapshot
An index to quantify an individual's scientific research output
inferredcites →https://doi.org/10.1103/physreve.109.014307openalex-snapshot
Nature of hypergraph k -core percolation problems
inferredcites →https://doi.org/10.1103/physreve.76.066102openalex-snapshot
Modularity and community detection in bipartite networks
inferredcites →https://doi.org/10.1109/asonam.2011.65openalex-snapshot
Evaluating Cooperation in Communities with the k-Core Structure
inferredcites →https://doi.org/10.1109/bigdata.2014.7004366openalex-snapshot
ParK: An efficient algorithm for k-core decomposition on multicore processors
inferredcites →https://doi.org/10.1109/icde.2011.5767911openalex-snapshot
Efficient core decomposition in massive networks
inferredcites →https://doi.org/10.1109/icde.2016.7498235openalex-snapshot
I/O efficient Core Graph Decomposition at web scale
inferredcites →https://doi.org/10.1109/icde.2019.00015openalex-snapshot
Index-Based Optimal Algorithm for Computing K-Cores in Large Uncertain Graphs
inferredcites →https://doi.org/10.1109/icde51399.2021.00199openalex-snapshot
Hypercore Maintenance in Dynamic Hypergraphs
inferredcites →https://doi.org/10.1109/icde55515.2023.00039openalex-snapshot
Finer-Grained Engagement in Hypergraphs
inferredcites →https://doi.org/10.1109/icde55515.2023.00160openalex-snapshot
HGMatch: A Match-by-Hyperedge Approach for Subgraph Matching on Hypergraphs
inferredcites →https://doi.org/10.1109/ipdps.2004.1303205openalex-snapshot
A hypergraph model for the yeast protein complex network
inferredcites →https://doi.org/10.1109/ipdpsw.2017.151openalex-snapshot
Parallel k-Core Decomposition on Multicore Platforms
inferredcites →https://doi.org/10.1109/tits.2022.3168879openalex-snapshot
Multitask Hypergraph Convolutional Networks: A Heterogeneous Traffic Prediction Framework
inferredcites →https://doi.org/10.1109/tkde.2018.2833070openalex-snapshot
I/O Efficient Core Graph Decomposition: Application to Degeneracy Ordering
inferredcites →https://doi.org/10.1109/tkde.2020.3023925openalex-snapshot
Computing K-Cores in Large Uncertain Graphs: An Index-based Optimal Approach
inferredcites →https://doi.org/10.1109/tpds.2012.124openalex-snapshot
Distributed k-Core Decomposition
inferredcites →https://doi.org/10.1109/vis49827.2021.9623305openalex-snapshot
Towards a Survey on Static and Dynamic Hypergraph Visualizations
inferredcites →https://doi.org/10.1145/1217299.1217301openalex-snapshot
Graph evolution
inferredcites →https://doi.org/10.1145/2588555.2612179openalex-snapshot
Local search of communities in large graphs
inferredcites →https://doi.org/10.1145/2623330.2623655openalex-snapshot
Core decomposition of uncertain graphs
inferredcites →https://doi.org/10.1145/2783258.2789987openalex-snapshot
Dense Subgraph Discovery
inferredcites →https://doi.org/10.1145/3087556.3087580openalex-snapshot
Julienne
inferredcites →https://doi.org/10.1145/3219819.3219829openalex-snapshot
E-tail Product Return Prediction via Hypergraph-based Local Graph Cut
inferredcites →https://doi.org/10.1145/3385416openalex-snapshot
Fully Dynamic Approximate k-Core Decomposition in Hypergraphs
inferredcites →https://doi.org/10.1145/3442381.3450010openalex-snapshot
How Do Hyperedges Overlap in Real-World Hypergraphs? - Patterns, Measures, and Generators
inferredcites →https://doi.org/10.1145/3583780.3615275openalex-snapshot
Exploring Cohesive Subgraphs in Hypergraphs: The (k,g)-core Approach
inferredcites →https://doi.org/10.1145/3627673.3679765openalex-snapshot
Hierarchical Structure Construction on Hypergraphs
inferredcites →https://doi.org/10.1145/3655693.3661300openalex-snapshot
A Hypergraph-based Model for Cyberincident-related Data Analysis
inferredcites →https://doi.org/10.1371/journal.pcbi.1000385openalex-snapshot
Hypergraphs and Cellular Networks
inferredcites →https://doi.org/10.14778/2535568.2448942openalex-snapshot
Large scale cohesive subgraphs discovery for social network visual analysis
inferredcites →https://doi.org/10.14778/2536336.2536344openalex-snapshot
Streaming algorithms for k-core decomposition
inferredcites →https://doi.org/10.14778/2850469.2850471openalex-snapshot
K-core decomposition of large networks on a single PC
inferredcites →https://doi.org/10.14778/3476249.3476260openalex-snapshot
On querying historical k-cores
inferredcites →https://doi.org/10.14778/3598581.3598582openalex-snapshot
Neighborhood-Based Hypergraph Core Decomposition
inferredcites →https://doi.org/10.20429/tag.2015.020205openalex-snapshot
Connection and separation in hypergraphs
inferredcites →https://doi.org/10.3389/fphy.2023.1301994openalex-snapshot
Hypergraph patterns and collaboration structure
inferredcites →https://doi.org/10.3390/math10111921openalex-snapshot
Hypergraph and Uncertain Hypergraph Representation Learning Theory and Methods
inferredcites →https://doi.org/10.4108/eetsis.7431openalex-snapshot
High-Order Local Clustering on Hypergraphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-981-95-6196-4_4openalex-snapshot
An Experimental Study of Graph Pattern Mining Systems
inferred← citeshttps://doi.org/10.1109/ecnct70535.2026.11661487openalex-snapshot
Systematic Cross-System Optimization of Parallel Hypergraph K-Core Decomposition: An Empirical Study
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00260openalex-snapshot
Efficient Structural Clustering Over Hypergraphs
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00190openalex-snapshot
Listing Minimal Cores in Large Real-World Graphs
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00207openalex-snapshot
HistCore: Scalable $k$-Core Decomposition on GPUs with Locality-Aware Computation
inferred← citeshttps://doi.org/10.1109/tc.2025.3646191openalex-snapshot
AdaptiveCore: Adaptive Parallel Core Decomposition Framework
inferred← citeshttps://doi.org/10.1145/3769837openalex-snapshot
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach
inferred← citeshttps://doi.org/10.1145/3802092openalex-snapshot
Nucleus Decomposition Revisited: An Efficient Counting-Based Approach
inferred← citeshttps://doi.org/10.1145/3848520openalex-snapshot
Efficient and Complete Triangle Counting in Hypergraph Streams
inferred← citeshttps://doi.org/10.14778/3785297.3785312openalex-snapshot
Efficient Temporal Edge-Core Maintenance in Streaming Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.