scientific article; zbMATH DE number 1863545
From MaRDI portal
Publication:4790880
DOI<1131::AID-CPE528>3.0.CO;2-2 10.1002/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2zbMath1008.68565MaRDI QIDQ4790880
Fredrik Manne, Assefaw Hadish Gebremedhin
Publication date: 4 February 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
AmgX: A Library for GPU Accelerated Algebraic Multigrid and Preconditioned Iterative Methods ⋮ Parallel graph component labelling with GPUs and CUDA ⋮ Graph coloring on coarse grained multicomputers ⋮ A framework for scalable greedy coloring on distributed-memory parallel computers ⋮ Graph Coloring Using GPUs ⋮ FEM and BEM parallel processing: theory and applications – a bibliography (1996‐2002)
Cites Work
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- On colouring random graphs
- An application of graph coloring to printed circuit testing
- New methods to color the vertices of a graph
- A Parallel Graph Coloring Heuristic
- An upper bound for the chromatic number of a graph and its application to timetabling problems
This page was built for publication:
