On the public citation graph
Balanced Coloring for Parallel Computing Applications
0 signed · 36 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.1006/jpdc.1996.0117openalex-snapshot
Parallel Heuristics for Improved, Balanced Graph Colorings
inferredcites →https://doi.org/10.1007/978-1-4614-6624-6_25-1openalex-snapshot
Equitable Coloring of Graphs
inferredcites →https://doi.org/10.1007/978-3-662-03217-6openalex-snapshot
Scheduling Computer and Manufacturing Processes
inferredcites →https://doi.org/10.1007/978-3-662-04363-9openalex-snapshot
Scheduling Computer and Manufacturing Processes
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/j.tcs.2005.09.027openalex-snapshot
Equitable colorings of bounded treewidth graphs
inferredcites →https://doi.org/10.1016/s0898-1221(97)90035-3openalex-snapshot
Domain decomposition: Parallel multilevel methods for elliptic partial differential equations
inferredcites →https://doi.org/10.1088/1742-5468/2008/10/p10008openalex-snapshot
Fast unfolding of communities in large networks
inferredcites →https://doi.org/10.1090/dimacs/026/13openalex-snapshot
Exploring the k-colorable landscape with iterated greedy
inferredcites →https://doi.org/10.1103/physreve.69.066133openalex-snapshot
Fast algorithm for detecting community structure in networks
inferredcites →https://doi.org/10.1109/hipc.2014.7116708openalex-snapshot
Scaling graph community detection on the Tilera many-core architecture
inferredcites →https://doi.org/10.1109/ipdpsw.2014.155openalex-snapshot
Parallel Heuristics for Scalable Community Detection
inferredcites →https://doi.org/10.1137/1015072openalex-snapshot
Perfect Graphs and an Application to Optimizing Municipal Services
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.1145/45054.214373openalex-snapshot
Multicolor reordering of sparse matrices resulting from irregular grids
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-20081-7_16openalex-snapshot
A Parallel MCMC Algorithm for the Balanced Graph Coloring Problem
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.jpdc.2019.05.014openalex-snapshot
HyPar: A divide-and-conquer model for hybrid CPU–GPU graph processing
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/cases.2015.7324555openalex-snapshot
High performance and energy efficient wireless NoC-enabled multicore architectures for graph analytics
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/ipdps.2016.54openalex-snapshot
Parallel Graph Coloring for Manycore Architectures
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.2016.2620142openalex-snapshot
Algorithms for Balanced Graph Colorings with Applications in Parallel Computing
inferred← citeshttps://doi.org/10.1145/2961027openalex-snapshot
High-Performance and Energy-Efficient Network-on-Chip Architectures for Graph Analytics
inferred← citeshttps://doi.org/10.1145/3007748.3018282openalex-snapshot
Balancing Maximal Independent Sets using Hadoop
inferred← citeshttps://doi.org/10.1145/3061639.3062194openalex-snapshot
Accelerating Graph Community Detection with Approximate Updates via an Energy-Efficient NoC
inferred← citeshttps://doi.org/10.1145/3225058.3225137openalex-snapshot
A Distributed Infomap Algorithm for Scalable and High-Quality Community Detection
inferred← citeshttps://doi.org/10.12681/eadd/52494openalex-snapshot
Accelerating irregular applications via efficient synchronization and data access techniques
inferred← citeshttps://doi.org/10.1561/1000000044openalex-snapshot
Fast Uncovering of Graph Communities on a Chip: Toward Scalable Community Detection on Multicore and Manycore Platforms
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.