On the public citation graph

Efficient and high‐quality sparse graph coloring on GPUs

https://doi.org/10.1002/cpe.4064
0 signed · 64 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/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2openalex-snapshot
Scalable parallel graph coloring algorithms
inferredcites →https://doi.org/10.1006/jpdc.1996.0117openalex-snapshot
Parallel Heuristics for Improved, Balanced Graph Colorings
inferredcites →https://doi.org/10.1007/978-3-319-17248-4_4openalex-snapshot
A CUDA Implementation of the High Performance Conjugate Gradient Benchmark
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/0305-0548(86)90061-4openalex-snapshot
A graph coloring algorithm for large scale scheduling problems
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.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/12.42122openalex-snapshot
Scans as primitive parallel operations
inferredcites →https://doi.org/10.1109/iiswc.2012.6402918openalex-snapshot
A quantitative study of irregular programs on GPUs
inferredcites →https://doi.org/10.1109/iiswc.2013.6704684openalex-snapshot
Pannotia: Understanding irregular GPGPU graph applications
inferredcites →https://doi.org/10.1109/iiswc.2014.6983053openalex-snapshot
Graph processing on GPUs: Where are the bottlenecks?
inferredcites →https://doi.org/10.1109/iiswc.2015.12openalex-snapshot
Locality Exists in Graph Processing: Workload Characterization on an Ivy Bridge Server
inferredcites →https://doi.org/10.1109/iiswc.2015.13openalex-snapshot
Performance Characterization of High-Level Programming Models for GPU Graph Analytics
inferredcites →https://doi.org/10.1109/ipdps.2010.5470477openalex-snapshot
Inter-block GPU communication via fast barrier synchronization
inferredcites →https://doi.org/10.1109/ipdps.2011.59openalex-snapshot
Computing Strongly Connected Components in Parallel on CUDA
inferredcites →https://doi.org/10.1109/ipdps.2013.28openalex-snapshot
Data-Driven Versus Topology-driven Irregular Computations on GPUs
inferredcites →https://doi.org/10.1109/ipdps.2014.45openalex-snapshot
Work-Efficient Parallel GPU Methods for Single-Source Shortest Paths
inferredcites →https://doi.org/10.1109/mm.2011.89openalex-snapshot
GPUs and the Future of Parallel Computing
inferredcites →https://doi.org/10.1109/sc.2014.52openalex-snapshot
Scalable and High Performance Betweenness Centrality on the GPU
inferredcites →https://doi.org/10.1109/tpds.2013.111openalex-snapshot
Medusa: Simplified Graph Processing on GPUs
inferredcites →https://doi.org/10.1109/vlsi-soc.2015.7314415openalex-snapshot
Locality-aware vertex scheduling for GPU-based graph computation
inferredcites →https://doi.org/10.1137/0914041openalex-snapshot
A Parallel Graph Coloring Heuristic
inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot
R-MAT: A Recursive Model for Graph Mining
inferredcites →https://doi.org/10.1145/1132516.1132612openalex-snapshot
Linear degree extractors and the inapproximability of max clique and chromatic number
inferredcites →https://doi.org/10.1145/1572769.1572796openalex-snapshot
Fast minimum spanning tree for large graphs on the GPU
inferredcites →https://doi.org/10.1145/1807167.1807184openalex-snapshot
Pregel
inferredcites →https://doi.org/10.1145/1837274.1837289openalex-snapshot
An effective GPU implementation of breadth-first search
inferredcites →https://doi.org/10.1145/1941553.1941590openalex-snapshot
Accelerating CUDA graph algorithms at maximum warp
inferredcites →https://doi.org/10.1145/1941553.1941597openalex-snapshot
Evaluating graph coloring on GPUs
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.1145/2145816.2145832openalex-snapshot
Scalable GPU graph traversal
inferredcites →https://doi.org/10.1145/2145816.2145842openalex-snapshot
Scalable parallel minimum spanning forest computation
inferredcites →https://doi.org/10.1145/2150976.2151013openalex-snapshot
Green-Marl
inferredcites →https://doi.org/10.1145/22145.22146openalex-snapshot
A simple parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1145/2442516.2442530openalex-snapshot
Ligra
inferredcites →https://doi.org/10.1145/2442516.2442531openalex-snapshot
Morph algorithms on GPUs
inferredcites →https://doi.org/10.1145/2442516.2442539openalex-snapshot
StreamScan
inferredcites →https://doi.org/10.1145/2458523.2458533openalex-snapshot
Atomic-free irregular computations on GPUs
inferredcites →https://doi.org/10.1145/2517349.2522739openalex-snapshot
A lightweight infrastructure for graph analytics
inferredcites →https://doi.org/10.1145/253260.253263openalex-snapshot
Fast parallel similarity search in multimedia databases
inferredcites →https://doi.org/10.1145/2600212.2600227openalex-snapshot
CuSha
inferredcites →https://doi.org/10.1145/2612669.2612673openalex-snapshot
Executing dynamic data-graph computations deterministically using chromatic scheduling
inferredcites →https://doi.org/10.1145/2612669.2612697openalex-snapshot
Ordering heuristics for parallel graph coloring
inferredcites →https://doi.org/10.1145/2621934.2621936openalex-snapshot
MapGraph
inferredcites →https://doi.org/10.1145/2749469.2750386openalex-snapshot
A scalable processing-in-memory accelerator for parallel graph processing
inferredcites →https://doi.org/10.1145/2851141.2851145openalex-snapshot
Gunrock
inferredcites →https://doi.org/10.1145/2854038.2854046openalex-snapshot
Exploiting recent SIMD architectural advances for irregular applications
inferredcites →https://doi.org/10.1145/872726.806984openalex-snapshot
Register allocation & spilling via graph coloring

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.70940openalex-snapshot
BRIGHT: Bucket‐Based Recoloring and Iterative Greedy Heuristic Technique for Parallel Graph Coloring on GPUs
inferred← citeshttps://doi.org/10.1007/978-3-030-18590-9_32openalex-snapshot
GPU-Accelerated Dynamic Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-3-031-99939-0_11openalex-snapshot
Optimizing Compiler Efficiency: A Comparative Study of Parallelization Frameworks for Register Allocation
inferred← citeshttps://doi.org/10.1007/978-981-95-5747-9_2openalex-snapshot
Graph Traversal Algorithms on GPU
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.1016/j.future.2018.04.071openalex-snapshot
clMF: A fine-grained and portable alternating least squares algorithm for parallel matrix factorization
inferred← citeshttps://doi.org/10.1016/j.patrec.2021.05.014openalex-snapshot
Analysis of a parallel MCMC algorithm for graph coloring with nearly uniform balancing
inferred← citeshttps://doi.org/10.1109/ipdpsw71298.2026.00079openalex-snapshot
GPU synchronization-free multicolor DILU for Nvidia AmgX library
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.2020.3014173openalex-snapshot
Feluca: A Two-Stage Graph Coloring Algorithm With Color-Centric Paradigm on GPU
inferred← citeshttps://doi.org/10.1145/3195612.3195614openalex-snapshot
High performance graph analytics with productivity on hybrid CPU-GPU platforms
inferred← citeshttps://doi.org/10.1145/3283450openalex-snapshot
GARDENIA
inferred← citeshttps://doi.org/10.1145/3332466.3374519openalex-snapshot
Increasing the parallelism of graph coloring via shortcutting
inferred← citeshttps://doi.org/10.1145/3543545openalex-snapshot
Improving the Speed and Quality of Parallel Graph Coloring
inferred← citeshttps://doi.org/10.1145/3570638openalex-snapshot
Optimization Techniques for GPU Programming
inferred← citeshttps://doi.org/10.1155/2018/9340697openalex-snapshot
HPGraph: High-Performance Graph Analytics with Productivity on the GPU
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.