A framework for scalable greedy coloring on distributed-memory parallel computers
DOI10.1016/J.JPDC.2007.08.002zbMATH Open1243.68314OpenAlexW2122677148MaRDI QIDQ436752FDOQ436752
Authors: Doruk Bozdağ, Fredrik Manne, E. G. Boman, Ümit V. Çatalyürek, Assefaw H. 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
Recommendations
scientific computinggraph coloringparallel algorithmsdistributed-memory computersexperimental algorithmics
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Parallel algorithms in computer science (68W10) Distributed systems (68M14)
Cites Work
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Title not available (Why is that?)
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A Parallel Graph Coloring Heuristic
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Simple distributed \(\Delta+1\)-coloring of graphs
- Heuristic for rapidly four-coloring large planar graphs
- Scalable iterative solution of sparse linear systems
- Graph coloring on coarse grained multicomputers
- An experimental analysis of simple, distributed vertex coloring algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- Parallel Performance Model for Vertex Repositioning Algorithms and Application to Mesh Partitioning
- Vertex coloring of a graph for memory constrained scenarios
- Graph coloring using peer-to-peer networks
- Title not available (Why is that?)
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
- Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation
- Evaluation of serial and parallel shared-memory distance-1 graph coloring algorithms
- Iterative computations with ordered read-write locks
Uses Software
This page was built for publication: A framework for scalable greedy coloring on distributed-memory parallel computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436752)
