A parallel variant of a heuristical algorithm for graph coloring -- corrigendum

DOI10.1016/0167-8191(92)90035-6zbMath0792.68131OpenAlexW2031937168MaRDI QIDQ1200998

Matjaž Kaufman, Janez Žerovnik

Publication date: 17 January 1993

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90035-6

zbMATH Keywords

combinatorial problemgraph colouringparallel algorithmantivoter modelrandomised heuristics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

A randomized algorithm for \(k\)-colorability ⋮ Clustering as a dual problem to colouring

This page was built for publication: A parallel variant of a heuristical algorithm for graph coloring -- corrigendum