Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

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.

Affiliations

Universiti Teknologi Malaysia

Abstract

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.

Item Type:Journal
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
ID Code:597

Dailey, D.P. Uniqueness Of Colourability And Colourability Of Planar 4-Regular Graphs Are Np-Complete. Discrete Mathematics 30, (1980), 289-293.

Garey, M.R. And Johnson, D.S. The Complexity Of Near-Optimal Graph Colouring. Journal Of The Acm 23, (1976), 43-49.

Karp, R.M. Reducibility Among Combinatorial Problems. Complexity Of Computer Computations, Miller, R.E. And Thatcher, J.W. (Ed.), Plenum Press, New York, 1972, 85-104.

Chrjstofides N. An Algorithm For The Chromatic Number Of A Graph. The Computer Journal 14, (1971), 38-39.

Liu, C.L. Introduction To Combinatorial Mathematics. Mcgraw-Hill, New York, 1968.

Christofides, N. Graph Theory - An Algorithmic Approach. Academic Press, London, 1975.

Berge, C. Graphs And Hypergraphs. North Holland, Amsterdam, 1973.

Bron, C. And Kerbosch, J. Algorithm 457 - Finding All Cliques Of An Undirected Graph. Communications Of The Acm..14, (1973), 575-577.

Dunstan, F.D.J. Sequential Colourings Of Graph. Proc. Of The 5th. British Combinatorial Conference, Aberdeen. Congressus Numeratium Xv, Utilitas Mathematica Publishing, Winnipeg, Canada, 1976, 151-158.

Matula, D.W., Marble, G. And Isaacson, J.D. Graph Algorithms.Graph Theory And Computing, Read, R.C. (Ed), Academic Press, New York, 1972, 109-122.

Rrelaz, D. New Methods To Colour The Vertices Of A Graph. Communications Of The Acm 22, (1979), 251-256.

Ghazali Sulong, Algorithms For Timetable Construction. Ph.D. Thesis, University Of Wales College Of Cardiff, 1989.

Repository Staff Only: item control page
 
 
 
 
 
 
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.