A framework for scalable greedy coloring on distributed-memory parallel computers
From MaRDI portal
Publication:436752
DOI10.1016/j.jpdc.2007.08.002zbMath1243.68314OpenAlexW2122677148MaRDI QIDQ436752
Doruk Bozdağ, Erik G. Boman, Fredrik Manne, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin
Publication date: 26 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.08.002
graph coloringparallel algorithmsscientific computingdistributed-memory computersexperimental algorithmics
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Coloring of graphs and hypergraphs (05C15) Distributed systems (68M14)
Related Items
Vertex coloring of a graph for memory constrained scenarios ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Parallel Performance Model for Vertex Repositioning Algorithms and Application to Mesh Partitioning ⋮ Iterative computations with ordered read-write locks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristic for rapidly four-coloring large planar graphs
- Scalable iterative solution of sparse linear systems
- Graph coloring on coarse grained multicomputers
- Simple distributed \(\Delta+1\)-coloring of graphs
- An experimental analysis of simple, distributed vertex coloring algorithms
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Parallel Graph Coloring Heuristic
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- Benchmarking optimization software with performance profiles.
