A New Graph Colouring Algorithm For Large Scale Scheduling Problems
Ghazali Sulong, (1989) A New Graph Colouring Algorithm For Large Scale Scheduling Problems. Malaysian Journal of Computer Science, 5 . pp. 24-36. ISSN 0127-9084
Full text not available from this repository.
Universiti Teknologi Malaysia
This paper describes an efficient new heuristic algorithm which is based on the concept of maximal independent sets. A computational comparison of this method compared to various well- is given. This algorithm can efficiently be applied to large scale scheduling problems.
|Additional Information:||This note was added by the search_and_modify.pl script.|
|Keywords:||Np-Hard, Graph Colouring, Scheduling, Maximal Independent Sets, Cliques, Chromatic Number.|
|Subjects:||Q Science, Computer Science|
Repository Staff Only: item control page