On the public citation graph

Scalable Hybrid Implementation of Graph Coloring Using MPI and OpenMP

https://doi.org/10.1109/ipdpsw.2012.216
0 signed · 39 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-642-23397-5_24openalex-snapshot
New Multithreaded Ordering and Coloring Algorithms for Multicore 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.parco.2012.07.001openalex-snapshot
Graph coloring algorithms for multi-core and massively multithreaded architectures
inferredcites →https://doi.org/10.1090/conm/352/06369openalex-snapshot
Classical coloring of graphs
inferredcites →https://doi.org/10.1109/hipc.2011.6152726openalex-snapshot
Improving graph coloring on distributed-memory parallel computers
inferredcites →https://doi.org/10.1109/ipdps.2011.16openalex-snapshot
Overlapping Computation and Communication for Advection on Hybrid Parallel Computers
inferredcites →https://doi.org/10.1109/ipdps.2011.169openalex-snapshot
Hybrid MPI/OpenMP Strategy for Biological Multiple Sequence Alignment with DIALIGN-TX in Heterogeneous Multicore Clusters
inferredcites →https://doi.org/10.1109/ipdps.2011.332openalex-snapshot
Parallel Sparse Matrix-Vector Multiplication as a Test Case for Hybrid MPI+OpenMP Programming
inferredcites →https://doi.org/10.1109/ipdps.2011.35openalex-snapshot
Challenges of Scaling Algebraic Multigrid Across Modern Multicore Architectures
inferredcites →https://doi.org/10.1109/ipdpsw.2010.5470691openalex-snapshot
Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system
inferredcites →https://doi.org/10.1109/sfcs.1975.3openalex-snapshot
An application of graph coloring to printed circuit testing
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0720013openalex-snapshot
Estimation of Sparse Jacobian Matrices and Graph Coloring Problems
inferredcites →https://doi.org/10.1137/0914041openalex-snapshot
A Parallel Graph Coloring Heuristic
inferredcites →https://doi.org/10.1137/s0036144504444711openalex-snapshot
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
inferredcites →https://doi.org/10.1142/s0129626407002843openalex-snapshot
CHALLENGES IN PARALLEL GRAPH PROCESSING
inferredcites →https://doi.org/10.1145/1065895.1065899openalex-snapshot
Metrics and models for reordering transformations
inferredcites →https://doi.org/10.1145/2402.322385openalex-snapshot
Smallest-last ordering and clustering and graph coloring algorithms
inferredcites →https://doi.org/10.1145/872726.806984openalex-snapshot
Register allocation & spilling via graph coloring
inferredcites →https://doi.org/10.4086/toc.2007.v003a006openalex-snapshot
inferredcites →https://doi.org/10.7939/r3m32nh6qopenalex-snapshot
Iterated Greedy Graph Coloring and the Difficulty Landscape

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-030-50743-5_7openalex-snapshot
Shared-Memory Parallel Probabilistic Graphical Modeling Optimization: Comparison of Threads, OpenMP, and Data-Parallel Primitives
inferred← citeshttps://doi.org/10.1007/978-981-95-5747-9_2openalex-snapshot
Graph Traversal Algorithms on GPU
inferred← citeshttps://doi.org/10.1016/j.gi.2015.04.002openalex-snapshot
Forward modeling of gravitational fields on hybrid multi-threaded cluster
inferred← citeshttps://doi.org/10.1016/j.parco.2022.102896openalex-snapshot
Parallel graph coloring algorithms for distributed GPU environments
inferred← citeshttps://doi.org/10.1109/elconrus51938.2021.9396526openalex-snapshot
Fast Polygons Proximity Detection for ICs Multiple Patterning Lithography
inferred← citeshttps://doi.org/10.1109/ia351965.2020.00013openalex-snapshot
Distributed Memory Graph Coloring Algorithms for Multiple GPUs
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/ikt.2013.6620033openalex-snapshot
Implementation of a parallel method for the graph coloring problem using MPI and verification of the number of processors on it
inferred← citeshttps://doi.org/10.1109/ipdps.2016.54openalex-snapshot
Parallel Graph Coloring for Manycore Architectures
inferred← citeshttps://doi.org/10.1109/ipdpsw59300.2023.00147openalex-snapshot
Optimizing the Critical Path of Distributed Dataflow Graph Algorithms
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.31114/2078-7707-2020-3-41-48openalex-snapshot
Speeding up the evaluation of polygons mutual placement task for double pattern technology
inferred← citeshttps://doi.org/10.4018/978-1-7998-7156-9.ch005openalex-snapshot
Paradigms for Effective Parallelization of Inherently Sequential Graph Algorithms on Multi-Core Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1701.02628openalex-snapshot
Greed is Good: Optimistic Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures
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.