A framework for scalable greedy coloring on distributed-memory parallel computers
From MaRDI portal
(Redirected from Publication:436752)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1863545 (Why is no real title available?)
- scientific article; zbMATH DE number 2090688 (Why is no real title available?)
- scientific article; zbMATH DE number 2116061 (Why is no real title available?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Parallel Graph Coloring Heuristic
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- An experimental analysis of simple, distributed vertex coloring algorithms
- Benchmarking optimization software with performance profiles.
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Graph coloring on coarse grained multicomputers
- Heuristic for rapidly four-coloring large planar graphs
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- Scalable iterative solution of sparse linear systems
- Simple distributed +1-coloring of graphs
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
Cited in
(9)- Parallel Performance Model for Vertex Repositioning Algorithms and Application to Mesh Partitioning
- scientific article; zbMATH DE number 1863545 (Why is no real title available?)
- Vertex coloring of a graph for memory constrained scenarios
- Graph coloring using peer-to-peer networks
- scientific article; zbMATH DE number 1696533 (Why is no real title available?)
- 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
- Iterative computations with ordered read-write locks
- Evaluation of serial and parallel shared-memory distance-1 graph coloring algorithms
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)