A Parallel Graph Coloring Heuristic
From MaRDI portal
Recommendations
Cited in
(30)- Parallel assembly of finite element matrices on multicore computers
- Evolutionary Computation in Combinatorial Optimization
- Parallel multigrid solvers for 3D unstructured finite element problems in large deformation elasticity and plasticity
- A parallel algorithm for solving the coloring problem on trapezoid graphs
- scientific article; zbMATH DE number 1863545 (Why is no real title available?)
- On graph coloring in a class of parallel local algorithms
- A framework for scalable greedy coloring on distributed-memory parallel computers
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- A new class of AMG interpolation methods based on matrix-matrix multiplications
- Phase transitions and the search problem
- A comparative study of scalable multilevel preconditioners for cardiac mechanics
- Vertex coloring of a graph for memory constrained scenarios
- scientific article; zbMATH DE number 554772 (Why is no real title available?)
- The independent set perturbation adjoint method: a new method of differentiating mesh-based fluids models
- Reducing complexity of algebraic multigrid by aggregation.
- A parallel variant of a heuristical algorithm for graph colouring
- Graph coloring on coarse grained multicomputers
- Refining the phase transition in combinatorial search
- A family of constrained pressure residual preconditioners for parallel reservoir simulations.
- Properties of the graph modularity matrix and its applications
- Graph coloring using GPUs
- A fast parallel algorithm to color a graph with Δ colors
- Diagonal threshold techniques in robust multi-level ILU preconditioners for general sparse linear systems
- Discontinuous diffusion synthetic acceleration for S_n transport on 2D arbitrary polygonal meshes
- \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
- A library of distributed iterative linear system solvers
- Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation
- An efficient parallel algebraic multigrid method for 3D injection moulding simulation based on finite volume method
- Evaluation of serial and parallel shared-memory distance-1 graph coloring algorithms
- AmgX: a library for GPU accelerated algebraic multigrid and preconditioned iterative methods
This page was built for publication: A Parallel Graph Coloring Heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4695051)
