On the public citation graph
Graph Colouring as a Challenge Problem for Dynamic Graph Processing on Distributed Systems
0 signed · 53 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2openalex-snapshot
Scalable parallel graph coloring algorithms
inferredcites →https://doi.org/10.1002/spe.587openalex-snapshot
UbiCrawler: a scalable fully distributed Web crawler
inferredcites →https://doi.org/10.1006/jagm.1996.0836openalex-snapshot
Parallel and On-Line Graph Coloring
inferredcites →https://doi.org/10.1007/978-3-540-27866-5_107openalex-snapshot
Distributed Largest-First Algorithm for Graph Coloring
inferredcites →https://doi.org/10.1007/978-3-662-48096-0_32openalex-snapshot
A Fast and Scalable Graph Coloring Algorithm for Multi-core and Many-core Architectures
inferredcites →https://doi.org/10.1016/j.jpdc.2007.08.002openalex-snapshot
A framework for scalable greedy coloring on distributed-memory parallel computers
inferredcites →https://doi.org/10.1016/j.parco.2012.07.001openalex-snapshot
Graph coloring algorithms for multi-core and massively multithreaded architectures
inferredcites →https://doi.org/10.1016/s0167-5060(08)70584-3openalex-snapshot
An On-Line Graph Coloring Algorithm with Sublinear Performance Ratio
inferredcites →https://doi.org/10.1093/comjnl/10.1.85openalex-snapshot
An upper bound for the chromatic number of a graph and its application to timetabling problems
inferredcites →https://doi.org/10.1109/hpec.2012.6408680openalex-snapshot
STINGER: High performance data structure for streaming graphs
inferredcites →https://doi.org/10.1109/iccnc.2015.7069325openalex-snapshot
Performance comparison of parallel graph coloring algorithms on BSP model using hadoop
inferredcites →https://doi.org/10.1109/ipdps.2013.72openalex-snapshot
Scaling Techniques for Massive Scale-Free Graphs in Distributed (External) Memory
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.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.1137/0720013openalex-snapshot
Estimation of Sparse Jacobian Matrices and Graph Coloring Problems
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/2517349.2522739openalex-snapshot
A lightweight infrastructure for graph analytics
inferredcites →https://doi.org/10.1145/258533.258660openalex-snapshot
Consistent hashing and random trees
inferredcites →https://doi.org/10.14778/2732286.2732294openalex-snapshot
Optimizing graph algorithms on pregel-like systems
inferredcites →https://doi.org/10.14778/2735508.2735517openalex-snapshot
Large-scale distributed graph computing systems
inferredcites →https://doi.org/10.1609/icwsm.v4i1.14033openalex-snapshot
Measuring User Influence in Twitter: The Million Follower Fallacy
inferredcites →https://doi.org/10.2172/1050644openalex-snapshot
Parallel Breadth-First Search on Distributed Memory Systems
inferredcites →https://doi.org/10.3844/jmssp.2006.439.441openalex-snapshot
New Graph Coloring Algorithms
inferredcites →https://doi.org/10.48550/arxiv.1312.3018openalex-snapshot
Efficient Large-Scale Graph Processing on Hybrid CPU and GPU Systems
inferredcites →https://doi.org/10.48550/arxiv.1408.0500openalex-snapshot
FlashGraph: Processing Billion-Node Graphs on an Array of Commodity SSDs
inferredcites →https://doi.org/10.48550/arxiv.1410.1903openalex-snapshot
Systems for Near Real-Time Analysis of Large-Scale Dynamic Graphs
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-13-5919-4_15openalex-snapshot
The Various Graphs in Graph Computing
inferred← citeshttps://doi.org/10.1007/s11227-022-04894-6openalex-snapshot
High-performance and balanced parallel graph coloring on multicore platforms
inferred← citeshttps://doi.org/10.1007/s11227-025-07696-8openalex-snapshot
An incremental algorithm for dynamic graph coloring based on graph reduction and adaptive recoloring strategies
inferred← citeshttps://doi.org/10.1109/bigdata59044.2023.10386845openalex-snapshot
Maximum Flow on Highly Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/cluster.2017.111openalex-snapshot
Co-locating Graph Analytics and HPC Applications
inferred← citeshttps://doi.org/10.1109/cluster.2017.85openalex-snapshot
Towards Practical and Robust Labeled Pattern Matching in Trillion-Edge Graphs
inferred← citeshttps://doi.org/10.1109/hipc.2017.00016openalex-snapshot
Parallel Asynchronous Distributed-Memory Maximal Independent Set Algorithm with Work Ordering
inferred← citeshttps://doi.org/10.1109/hipc56025.2022.00027openalex-snapshot
Parallel Vertex Color Update on Large Dynamic Networks
inferred← citeshttps://doi.org/10.1109/icdcsw.2017.74openalex-snapshot
Accelerating Big Data Infrastructure and Applications (Ongoing Collaboration)
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00108openalex-snapshot
Incremental Graph Processing for On-line Analytics
inferred← citeshttps://doi.org/10.1109/pact.2019.00040openalex-snapshot
A Synchronization-Avoiding Distance-1 Grundy Coloring Algorithm for Power-Law Graphs
inferred← citeshttps://doi.org/10.1109/sc41405.2020.00103openalex-snapshot
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality
inferred← citeshttps://doi.org/10.1109/tpds.2018.2866242openalex-snapshot
Piggyback Game: Efficient Event Stream Dissemination in Online Social Network Systems
inferred← citeshttps://doi.org/10.1109/wiiat50758.2020.00035openalex-snapshot
Multi-agent Based Distributed MIS Selection for Dynamic Job Scheduling
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.1177/10943420211029299openalex-snapshot
EXAGRAPH: Graph and combinatorial methods for enabling exascale applications
inferred← citeshttps://doi.org/10.12681/eadd/52494openalex-snapshot
Accelerating irregular applications via efficient synchronization and data access techniques
inferred← citeshttps://doi.org/10.3390/app15116003openalex-snapshot
Recent Advances in Efficient Dynamic Graph Processing
inferred← citeshttps://doi.org/10.3934/nhm.2023075openalex-snapshot
Optimal secret share distribution in degree splitting communication networks
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.