A parallel variant of a heuristical algorithm for graph colouring

DOI10.1016/0167-8191(90)90122-PMaRDI QIDQ1262783zbMATH OpenOpenAlexFDO

Authors Janez Žerovnik

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90122-p

zbMATH Keywords

parallel algorithmgraph colouringcombinatorial problemantivoter modelrandomised heuristical algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A Parallel Graph Coloring Heuristic
• A parallel variant of a heuristical algorithm for graph coloring -- corrigendum
• scientific article; zbMATH DE number 956853
• scientific article; zbMATH DE number 4049082
• Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation
• A fast parallel algorithm to color a graph with Δ colors
• scientific article; zbMATH DE number 1863545
• scientific article; zbMATH DE number 4210190
• On graph coloring in a class of parallel local algorithms

Cited in

(9)

• A randomised heuristical algorithm for estimating the chromatic number of a graph
• Computational Science - ICCS 2004
• scientific article; zbMATH DE number 3928066 (Why is no real title available?)
• A parallel algorithm for solving the coloring problem on trapezoid graphs
• A fresh look at a randomized massively parallel graph coloring algorithm
• A randomized algorithm for \(k\)-colorability
• A fast parallel algorithm to color a graph with Δ colors
• A parallel variant of a heuristical algorithm for graph coloring -- corrigendum
• Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation

This page was built for publication: A parallel variant of a heuristical algorithm for graph colouring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262783)