On the public citation graph
Parallel Graph Coloring for Manycore Architectures
0 signed · 76 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.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/b978-1-4832-3187-7.50015-5openalex-snapshot
GRAPH COLORING ALGORITHMS††This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under contract SD-302 and by the National Science Foundation under contract GJ-446.
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.jpdc.2014.07.003openalex-snapshot
Kokkos: Enabling manycore performance portability through polymorphic memory access patterns
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.1109/ipdps.2015.113openalex-snapshot
Balanced Coloring for Parallel Computing Applications
inferredcites →https://doi.org/10.1109/ipdps.2015.54openalex-snapshot
High-Performance Graph Analytics on Manycore Processors
inferredcites →https://doi.org/10.1109/ipdpsw.2012.204openalex-snapshot
An Early Evaluation of the Scalability of Graph Algorithms on the Intel MIC Architecture
inferredcites →https://doi.org/10.1109/ipdpsw.2012.216openalex-snapshot
Scalable Hybrid Implementation of Graph Coloring Using MPI and OpenMP
inferredcites →https://doi.org/10.1109/ipdpsw.2015.74openalex-snapshot
Graph Coloring on the GPU and Some Techniques to Improve Load Imbalance
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/1.9780898718003openalex-snapshot
Iterative Methods for Sparse Linear Systems
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/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/2612669.2612697openalex-snapshot
Ordering heuristics for parallel 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.1007/978-3-032-01922-6_38openalex-snapshot
Parallel Algorithm for Coloring Large-Scale Graphs Using Pregel API of Graphx
inferred← citeshttps://doi.org/10.1007/978-3-319-92040-5_18openalex-snapshot
Combining HTM with RCU to Speed Up Graph Coloring on Multicore Platforms
inferred← citeshttps://doi.org/10.1007/978-981-95-5747-9_2openalex-snapshot
Graph Traversal Algorithms on GPU
inferred← citeshttps://doi.org/10.1007/s00778-020-00602-zopenalex-snapshot
Efficient maximum clique computation and enumeration over large sparse graphs
inferred← citeshttps://doi.org/10.1007/s00778-024-00861-0openalex-snapshot
GPU-based butterfly counting
inferred← citeshttps://doi.org/10.1007/s10586-023-03988-xopenalex-snapshot
A new distributed graph coloring algorithm for large graphs
inferred← citeshttps://doi.org/10.1007/s10766-024-00781-0openalex-snapshot
Giraph-Based Distributed Algorithms for Coloring Large-Scale Graphs
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.engappai.2021.104282openalex-snapshot
Memetic Teaching–Learning-Based Optimization algorithms for large graph coloring problems
inferred← citeshttps://doi.org/10.1016/j.future.2018.01.012openalex-snapshot
Efficient hybrid multicast approach in wireless data center network
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.05.014openalex-snapshot
HyPar: A divide-and-conquer model for hybrid CPU–GPU graph processing
inferred← citeshttps://doi.org/10.1016/j.parco.2017.11.001openalex-snapshot
Orchestrating parallel detection of strongly connected components on GPUs
inferred← citeshttps://doi.org/10.1016/j.parco.2018.06.009openalex-snapshot
Multithreaded sparse matrix-matrix multiplication for many-core and GPU architectures
inferred← citeshttps://doi.org/10.1016/j.parco.2022.102896openalex-snapshot
Parallel graph coloring algorithms for distributed GPU environments
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.1038/s41598-026-46916-wopenalex-snapshot
Exploring quantum annealing for coarse-grained protein folding
inferred← citeshttps://doi.org/10.1098/rsta.2019.0053openalex-snapshot
Preparing sparse solvers for exascale computing
inferred← citeshttps://doi.org/10.1109/access.2026.3722936openalex-snapshot
Toward Computation-Efficient High-Quality Graph Coloring on GPUs
inferred← citeshttps://doi.org/10.1109/ia351965.2020.00013openalex-snapshot
Distributed Memory Graph Coloring Algorithms for Multiple GPUs
inferred← citeshttps://doi.org/10.1109/icpads.2017.00082openalex-snapshot
An Analytical Study of Recursive Tree Traversal Patterns on Multi- and Many-Core Platforms
inferred← citeshttps://doi.org/10.1109/icpp.2017.57openalex-snapshot
Parallel Space-Time Kernel Density Estimation
inferred← citeshttps://doi.org/10.1109/icpp.2017.59openalex-snapshot
Greed Is Good: Parallel Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00108openalex-snapshot
Evaluating Thread Coarsening and Low-cost Synchronization on Intel Xeon Phi
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00035openalex-snapshot
Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00091openalex-snapshot
Mixed Precision $s$-step Conjugate Gradient with Residual Replacement on GPUs
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.120openalex-snapshot
A Study of Graph Decomposition Algorithms for Parallel Symmetry Breaking
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.8openalex-snapshot
Performance-portable sparse matrix-matrix multiplication for many-core architectures
inferred← citeshttps://doi.org/10.1109/ipdpsw.2018.00104openalex-snapshot
Scalable b-Matching on GPUs
inferred← citeshttps://doi.org/10.1109/ipdpsw71298.2026.00135openalex-snapshot
CHROMA: High-Quality Robust Graph Coloring on GPUs
inferred← citeshttps://doi.org/10.1109/isca45697.2020.00088openalex-snapshot
ScoRD: A Scoped Race Detector for GPUs
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-sustaincom-socialcom48970.2019.00191openalex-snapshot
Architectural Implications in Graph Processing of Accelerator with Gardenia Benchmark Suite
inferred← citeshttps://doi.org/10.1109/ispass.2018.00033openalex-snapshot
Performance Characterization of Multi-threaded Graph Processing Applications on Many-Integrated-Core Architecture
inferred← citeshttps://doi.org/10.1109/p3hpc51967.2020.00011openalex-snapshot
Workflows are the New Applications: Challenges in Performance, Portability, and Productivity
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/padsw.2018.8644624openalex-snapshot
Efficient Algorithms for Graph Coloring on GPU
inferred← citeshttps://doi.org/10.1109/pmbs56514.2022.00015openalex-snapshot
High-Performance GMRES Multi-Precision Benchmark: Design, Performance, and Challenges
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/tmscs.2018.2795543openalex-snapshot
Scalable and Performant Graph Processing on GPUs Using Approximate Computing
inferred← citeshttps://doi.org/10.1109/tpds.2018.2826533openalex-snapshot
Optimizations of Unstructured Aerodynamics Computations for Many-core Architectures
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/3007748.3018281openalex-snapshot
Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture
inferred← citeshttps://doi.org/10.1145/3026937.3026941openalex-snapshot
High Performance Detection of Strongly Connected Components in Sparse Graphs on GPUs
inferred← citeshttps://doi.org/10.1145/3458744.3473362openalex-snapshot
Impact of AVX-512 Instructions on Graph Partitioning Problems.
inferred← citeshttps://doi.org/10.1145/3543545openalex-snapshot
Improving the Speed and Quality of Parallel Graph Coloring
inferred← citeshttps://doi.org/10.1145/3571157openalex-snapshot
A Systematic Survey of General Sparse Matrix-matrix Multiplication
inferred← citeshttps://doi.org/10.1145/3750555.3811887openalex-snapshot
Mining Domain-Based Policies from Massive and Noisy Access Logs
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.32657/10356/72409openalex-snapshot
Optimized GPU algorithms for sparse data problems
inferred← citeshttps://doi.org/10.48550/arxiv.1701.02628openalex-snapshot
Greed is Good: Optimistic Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1912.01478openalex-snapshot
A Hybrid Graph Coloring Algorithm for GPUs
inferred← citeshttps://doi.org/10.48550/arxiv.2103.11991openalex-snapshot
Kokkos Kernels: Performance Portable Sparse/Dense Linear Algebra and Graph Kernels
inferred← citeshttps://doi.org/10.48550/arxiv.2104.01196openalex-snapshot
Two-Stage Gauss--Seidel Preconditioners and Smoothers for Krylov Solvers on a GPU cluster
inferred← citeshttps://doi.org/10.59254/sbpo-2018-85372openalex-snapshot
Estudo de Implementações Paralelas para Coloração de Grafos em Arquiteturas com Memória Compartilhada
inferred← citeshttps://doi.org/10.70675/d183afb9z9c73z4321za674zcbf6bc4930c0openalex-snapshot
Contributions au co-design de noyaux irréguliers sur architectures manycore : cas du remaillage anisotrope multi-échelle en mécanique des fluides numérique
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.