Evaluation of serial and parallel shared-memory distance-1 graph coloring algorithms

DOI10.1007/978-3-030-10692-8_12zbMath1416.68134OpenAlexW2908543267MaRDI QIDQ2420027

Siegfried Selberherr, Lukas Gnam, Josef Weinbub

Publication date: 5 June 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-10692-8_12

zbMATH Keywords

graph coloringparallel algorithmsdistance-1 coloringshared-memory algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Evaluation of serial and parallel shared-memory distance-1 graph coloring algorithms