On the public citation graph

ParK: An efficient algorithm for k-core decomposition on multicore processors

0 signed · 90 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/3-540-46648-7_9openalex-snapshot
Partitioning Approach to Visualization of Large Graphs
inferredcites →https://doi.org/10.1007/978-3-642-17517-6_36openalex-snapshot
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
inferredcites →https://doi.org/10.1007/s10618-011-0224-zopenalex-snapshot
Community detection in Social Media
inferredcites →https://doi.org/10.1016/0378-8733(83)90028-xopenalex-snapshot
Network structure and minimum degree
inferredcites →https://doi.org/10.1016/j.parco.2008.10.002openalex-snapshot
A class of parallel tiled linear algebra algorithms for multicore architectures
inferredcites →https://doi.org/10.1017/cbo9780511815478openalex-snapshot
Social Network Analysis
inferredcites →https://doi.org/10.1038/nbt1002-991openalex-snapshot
Analyzing yeast protein–protein interaction data obtained from different sources
inferredcites →https://doi.org/10.1038/nphys1746openalex-snapshot
Identification of influential spreaders in complex networks
inferredcites →https://doi.org/10.1073/pnas.0701175104openalex-snapshot
A model of Internet topology using k -shell decomposition
inferredcites →https://doi.org/10.1109/bibm.2013.6732603openalex-snapshot
Local k-core clustering for gene networks
inferredcites →https://doi.org/10.1109/pact.2011.14openalex-snapshot
Efficient Parallel Graph Exploration on Multi-Core CPU and GPU
inferredcites →https://doi.org/10.1109/saahpc.2011.18openalex-snapshot
A Class of Hybrid LAPACK Algorithms for Multicore and GPU Architectures
inferredcites →https://doi.org/10.1109/sc.2010.46openalex-snapshot
Scalable Graph Exploration on Multicore Processors
inferredcites →https://doi.org/10.1109/tkde.2013.158openalex-snapshot
Efficient Core Maintenance in Large Dynamic Graphs
inferredcites →https://doi.org/10.1109/tpds.2012.124openalex-snapshot
Distributed k-Core Decomposition
inferredcites →https://doi.org/10.14778/2536336.2536344openalex-snapshot
Streaming algorithms for k-core decomposition
inferredcites →https://doi.org/10.3934/nhm.2008.3.371openalex-snapshot
K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases
inferredcites →https://doi.org/10.48550/arxiv.1103.5320openalex-snapshot
Distributed k-Core Decomposition
inferredcites →https://doi.org/10.48550/arxiv.1210.3266openalex-snapshot
Detecting dense communities in large social and information networks with the Core & Peel algorithm
inferredcites →https://doi.org/10.48550/arxiv.1408.2041openalex-snapshot
GraphLab: A New Framework For Parallel Machine Learning
inferredcites →https://doi.org/10.48550/arxiv.cond-mat/0601240openalex-snapshot
MEDUSA - New Model of Internet Topology Using k-shell Decomposition
inferredcites →https://doi.org/10.48550/arxiv.cs/0504107openalex-snapshot
k-core decomposition: a tool for the visualization of large scale networks

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-1-4614-7163-9_110176-1openalex-snapshot
Core Decomposition of Massive, Information-Rich Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-7131-2_110176openalex-snapshot
Core Decomposition of Massive, Information-Rich Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-34980-6_2openalex-snapshot
Distributed Core Decomposition in Probabilistic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-97568-5_7openalex-snapshot
Future Work and Conclusion
inferred← citeshttps://doi.org/10.1007/978-3-319-50901-3_2openalex-snapshot
Generating Scaled Replicas of Real-World Complex Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-70087-8_91openalex-snapshot
Accelerating Core Decomposition in Large Temporal Networks Using GPUs
inferred← citeshttps://doi.org/10.1007/s00778-019-00587-4openalex-snapshot
The core decomposition of networks: theory, algorithms and applications
inferred← citeshttps://doi.org/10.1007/s00778-021-00658-5openalex-snapshot
Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs
inferred← citeshttps://doi.org/10.1007/s11227-024-06190-xopenalex-snapshot
Simplified algorithms for order-based core maintenance
inferred← citeshttps://doi.org/10.1007/s11280-020-00857-0openalex-snapshot
Core decomposition and maintenance in weighted graph
inferred← citeshttps://doi.org/10.1007/s11280-021-00907-1openalex-snapshot
VEK: a vertex-oriented approach for edge k-core problem
inferred← citeshttps://doi.org/10.1007/s11280-025-01356-wopenalex-snapshot
Efficient traversal for core maintenance in large-scale dynamic hypergraphs
inferred← citeshttps://doi.org/10.1007/s41109-017-0054-zopenalex-snapshot
Generating realistic scaled complex networks
inferred← citeshttps://doi.org/10.1017/nws.2016.20openalex-snapshot
NetworKit: A tool suite for large-scale complex network analysis
inferred← citeshttps://doi.org/10.1109/asonam.2018.8508642openalex-snapshot
K-Truss Decomposition of Large Networks on a Single Consumer-Grade Machine
inferred← citeshttps://doi.org/10.1109/bigdata.2018.8622056openalex-snapshot
Scalable K-Core Decomposition for Static Graphs Using a Dynamic Graph Data Structure
inferred← citeshttps://doi.org/10.1109/bigdata.2018.8622352openalex-snapshot
Enumerating Top-k Quasi-Cliques
inferred← citeshttps://doi.org/10.1109/bigdata66926.2025.11402436openalex-snapshot
A Parallel and Distributed Rust Library for Core Decomposition on Large Graphs
inferred← citeshttps://doi.org/10.1109/hipc.2017.00012openalex-snapshot
Shared-Memory Graph Truss Decomposition
inferred← citeshttps://doi.org/10.1109/hipc.2018.00016openalex-snapshot
Shared-Memory Parallel Maximal Clique Enumeration
inferred← citeshttps://doi.org/10.1109/hipc.2019.00016openalex-snapshot
Shared-Memory Parallel Maximal Biclique Enumeration
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091052openalex-snapshot
Parallel k-truss decomposition on multicore systems
inferred← citeshttps://doi.org/10.1109/hpec49654.2021.9622845openalex-snapshot
The K-Core Decomposition Algorithm Under the Framework of GraphBLAS
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00090openalex-snapshot
Hierarchical Core Decomposition in Parallel: From Construction to Subgraph Search
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00075openalex-snapshot
Distributed (α, β)-Core Decomposition over Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00142openalex-snapshot
Accelerating k-Core Decomposition by a GPU
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00189openalex-snapshot
Efficient Core Decomposition Over Large Heterogeneous Information Networks
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00211openalex-snapshot
Fast Multilayer Core Decomposition and Indexing
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00058openalex-snapshot
Accelerating D-Core Maintenance over Dynamic Directed Graphs
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00140openalex-snapshot
TDT: Tensor Based Directed Truss Decomposition
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/icra48506.2021.9562007openalex-snapshot
ROBIN: a Graph-Theoretic Approach to Reject Outliers in Robust Estimation using Invariants
inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00024openalex-snapshot
PivotScale: A Holistic Approach for Scalable Clique Counting
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.151openalex-snapshot
Parallel k-Core Decomposition on Multicore Platforms
inferred← citeshttps://doi.org/10.1109/ipdpsw52791.2021.00158openalex-snapshot
Shared-Memory Scalable k-Core Maintenance on Dynamic Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1109/ispass51385.2021.00036openalex-snapshot
A Case Against Hardware Managed DRAM Caches for NVRAM Based Systems
inferred← citeshttps://doi.org/10.1109/lra.2021.3116313openalex-snapshot
RANSIC: Fast and Highly Robust Estimation for Rotation Search and Point Cloud Registration Using Invariant Compatibility
inferred← citeshttps://doi.org/10.1109/tase.2025.3603614openalex-snapshot
RE-Formation: Resilient and Efficient Formation Planning in Large-Scale Distributed Aerial Swarms
inferred← citeshttps://doi.org/10.1109/tc.2025.3646191openalex-snapshot
AdaptiveCore: Adaptive Parallel Core Decomposition Framework
inferred← citeshttps://doi.org/10.1109/tcss.2021.3064836openalex-snapshot
Fast Core Maintenance in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/tpds.2018.2835441openalex-snapshot
Core Maintenance in Dynamic Graphs: A Parallel Approach Based on Matching
inferred← citeshttps://doi.org/10.1109/tpds.2019.2960226openalex-snapshot
Faster Parallel Core Maintenance Algorithms in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/tpds.2021.3090759openalex-snapshot
Efficient Distributed Approaches to Core Maintenance on Large Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/tpds.2023.3236669openalex-snapshot
Revisiting Core Maintenance for Dynamic Hypergraphs
inferred← citeshttps://doi.org/10.1145/3087556.3087580openalex-snapshot
Julienne
inferred← citeshttps://doi.org/10.1145/3210377.3210414openalex-snapshot
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
inferred← citeshttps://doi.org/10.1145/3301275.3302275openalex-snapshot
Atlas
inferred← citeshttps://doi.org/10.1145/3380936openalex-snapshot
Shared-memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs
inferred← citeshttps://doi.org/10.1145/3400903.3400931openalex-snapshot
Vectorising k-Core Decomposition for GPU Acceleration
inferred← citeshttps://doi.org/10.1145/3434393openalex-snapshot
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
inferred← citeshttps://doi.org/10.1145/3446637openalex-snapshot
Mining Largest Maximal Quasi-Cliques
inferred← citeshttps://doi.org/10.1145/3605573.3605597openalex-snapshot
Parallel Order-Based Core Maintenance in Dynamic Graphs
inferred← citeshttps://doi.org/10.1145/3654956openalex-snapshot
MCR-Tree: An Efficient Index for Multi-dimensional Core Search
inferred← citeshttps://doi.org/10.1145/3673038.3673111openalex-snapshot
SpeedCore: Space-efficient and Dependency-aware GPU Parallel Framework for Core Decomposition
inferred← citeshttps://doi.org/10.1145/3709656openalex-snapshot
Accelerating Core Decomposition in Billion-Scale Hypergraphs
inferred← citeshttps://doi.org/10.1145/3719205openalex-snapshot
OTM : Efficient k -Order-Based Core Maintenance in Large-Scale Dynamic Hypergraphs
inferred← citeshttps://doi.org/10.1145/3725332openalex-snapshot
Parallel k -Core Decomposition: Theory and Practice
inferred← citeshttps://doi.org/10.1145/3746238.3746240openalex-snapshot
Parallel k-Core Decomposition: Theory and Practice (Abstract)
inferred← citeshttps://doi.org/10.1145/3802064openalex-snapshot
Geld: Load-balanced D-Core Decomposition for Consumer GPUs
inferred← citeshttps://doi.org/10.14778/3389133.3389145openalex-snapshot
Single machine graph analytics on massive datasets using Intel optane DC persistent memory
inferred← citeshttps://doi.org/10.14778/3461535.3461542openalex-snapshot
Local algorithms for distance-generalized core decomposition over large dynamic graphs
inferred← citeshttps://doi.org/10.14778/3529337.3529340openalex-snapshot
Distributed D-core decomposition over large directed graphs
inferred← citeshttps://doi.org/10.20944/preprints202407.1408.v1openalex-snapshot
A Framework for Developing Strategic Cyber Threat Intelligence from Advanced Persistent Threat Analysis Reports Using Graph-Based Algorithms
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3040379/v1openalex-snapshot
Simplified Algorithms for Order-Based CoreMaintenance
inferred← citeshttps://doi.org/10.23919/icn.2021.0022openalex-snapshot
Public-Private-Core Maintenance in Public-Private-Graphs
inferred← citeshttps://doi.org/10.3390/app151910753openalex-snapshot
Detecting and Exploring Homogeneous Dense Groups via k-Core Decomposition and Core Member Filtering in Social Networks
inferred← citeshttps://doi.org/10.4018/978-1-5225-3799-1.ch002openalex-snapshot
Core Kernels for Complex Network Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.2011.07190openalex-snapshot
Centrality Measures in Complex Networks: A Survey
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.