Graph colouring algorithms (Q2822600)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph colouring algorithms |
scientific article; zbMATH DE number 6632116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph colouring algorithms |
scientific article; zbMATH DE number 6632116 |
Statements
30 September 2016
0 references
graph colouring
0 references
vertex colouring
0 references
vertex-colouring algorithm
0 references
Graph colouring algorithms (English)
0 references
The focus of this work is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computations. The presentation aims to demonstrate the breadth of available techniques and is organized by the algorithmic paradigm.NEWLINENEWLINEFor the entire collection see [Zbl 1317.05004].
0 references
0.8089005947113037
0 references
0.7844001054763794
0 references
0.779510498046875
0 references
