Online Graph Colouring

Cited by: 10|Bibtex|Views1|

Abstract:

This paper considers the problem of online graph colouring. An algorithm for vertex-colouring graphs is said to be online if each vertex is irrevocably assigned a colour before later vertices are considered. We first introduce the problem formally and define a perfomance metric to evaluate the success of an online colouring algorithm. The...More

Code:

Data:

Your rating :
0

 

Tags
Comments