On the public citation graph

Incremental Graph Processing for On-line Analytics

0 signed · 33 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.1002/spe.587openalex-snapshot
UbiCrawler: a scalable fully distributed Web crawler
inferredcites →https://doi.org/10.1007/3-540-63165-8_214openalex-snapshot
Maintaining minimum spanning trees in dynamic graphs
inferredcites →https://doi.org/10.1109/ccgrid.2015.162openalex-snapshot
Real-Time Analytics for Fast Evolving Social Graphs
inferredcites →https://doi.org/10.1109/hpec.2012.6408680openalex-snapshot
STINGER: High performance data structure for streaming graphs
inferredcites →https://doi.org/10.1109/ipdpsw.2013.229openalex-snapshot
Multithreaded Community Monitoring for Massive Streaming Graph Data
inferredcites →https://doi.org/10.1109/ipdpsw.2016.189openalex-snapshot
Towards a Distributed Large-Scale Dynamic Graph Data Store
inferredcites →https://doi.org/10.1109/sc.2010.34openalex-snapshot
Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory
inferredcites →https://doi.org/10.1109/sc.2012.25openalex-snapshot
Breaking the speed and scalability Barriers for Graph exploration on distributed-memory machines
inferredcites →https://doi.org/10.1109/sc.2014.50openalex-snapshot
Faster Parallel Traversal of Scale Free Graphs at Extreme Scale with Vertex Delegates
inferredcites →https://doi.org/10.1109/sc.2016.29openalex-snapshot
Graph Colouring as a Challenge Problem for Dynamic Graph Processing on Distributed Systems
inferredcites →https://doi.org/10.1145/2063384.2063469openalex-snapshot
A scalable eigensolver for large scale-free graphs using 2D graph partitioning
inferredcites →https://doi.org/10.1145/2063384.2063471openalex-snapshot
Parallel breadth-first search on distributed memory systems
inferredcites →https://doi.org/10.1145/214451.214456openalex-snapshot
Distributed snapshots
inferredcites →https://doi.org/10.1145/2168836.2168846openalex-snapshot
Kineograph
inferredcites →https://doi.org/10.1145/258533.258660openalex-snapshot
Consistent hashing and random trees
inferredcites →https://doi.org/10.1145/2960414.2960419openalex-snapshot
Time-evolving graph processing at scale
inferredcites →https://doi.org/10.1145/320211.320215openalex-snapshot
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
inferredcites →https://doi.org/10.1609/icwsm.v4i1.14033openalex-snapshot
Measuring User Influence in Twitter: The Million Follower Fallacy
inferredcites →https://doi.org/10.5555/3014904.3014945openalex-snapshot
Graph colouring as a challenge problem for dynamic graph processing on distributed systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s00778-025-00951-7openalex-snapshot
On Querying Historical Connectivity in Large-scale Temporal Graphs
inferred← citeshttps://doi.org/10.1109/bigdata59044.2023.10386845openalex-snapshot
Maximum Flow on Highly Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/sbac-pad59825.2023.00020openalex-snapshot
A Distributed Algorithm for Identifying Strongly Connected Components on Incremental Graphs
inferred← citeshttps://doi.org/10.1109/scw63240.2024.00089openalex-snapshot
Batch Updates of Distributed Streaming Graphs using Linear Algebra
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.3131677openalex-snapshot
Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
inferred← citeshttps://doi.org/10.1145/3461837.3464514openalex-snapshot
Position paper
inferred← citeshttps://doi.org/10.1145/3588195.3593004openalex-snapshot
Real-Time PageRank on Dynamic Graphs
inferred← citeshttps://doi.org/10.1145/3594778openalex-snapshot
Proceedings of the 6th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)
inferred← citeshttps://doi.org/10.1145/3594778.3594882openalex-snapshot
Going with the Flow: Real-Time Max-Flow on Asynchronous Dynamic Graphs
inferred← citeshttps://doi.org/10.1145/3654960openalex-snapshot
On Querying Historical Connectivity in Temporal Graphs
inferred← citeshttps://doi.org/10.1145/3698038.3698524openalex-snapshot
IncBoost: Scaling Incremental Graph Processing for Edge Deletions and Weight Updates
inferred← citeshttps://doi.org/10.3929/ethz-b-000462546openalex-snapshot
Practice of Streaming and Dynamic Graphs: Concepts, Models, Systems, and Parallelism
inferred← citeshttps://doi.org/10.48550/arxiv.2112.00098openalex-snapshot
Connected Components for Infinite Graph Streams: Theory and Practice
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.