Pages that link to "Item:Q4790880"
From MaRDI portal
The following pages link to Scalable parallel graph coloring algorithms (Q4790880):
Displaying 12 items.
- A framework for scalable greedy coloring on distributed-memory parallel computers (Q436752) (← links)
- Parallel graph component labelling with GPUs and CUDA (Q608854) (← links)
- A parallel variant of a heuristical algorithm for graph coloring -- corrigendum (Q1200998) (← links)
- A parallel variant of a heuristical algorithm for graph colouring (Q1262783) (← links)
- Graph coloring on coarse grained multicomputers (Q1408826) (← links)
- (Q2766681) (← links)
- Batch Coloring of Graphs (Q2971156) (← links)
- Graph Coloring Using GPUs (Q3297570) (← links)
- AmgX: A Library for GPU Accelerated Algebraic Multigrid and Preconditioned Iterative Methods (Q3449799) (← links)
- (Q3708831) (← links)
- A Set of New Mapping and Coloring Heuristics for Distributed-Memory Parallel Processors (Q3990913) (← links)
- FEM and BEM parallel processing: theory and applications – a bibliography (1996‐2002) (Q4467364) (← links)