Skip Navigation

The Computer Journal 1984 27(2):165-170; doi:10.1093/comjnl/27.2.165
© 1984 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Williams, M. H.
Right arrow Articles by Milne, K. T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The Performance of Algorithms for Colouring Planar Graphs

M. H. Williams * and K. T. Milne *

Computer Science Department, Heriot-Watt University, 79 Grassmarket, Edinburgh, UK

As the number of different methods for colouring graphs increases so also does the need to evaluate and compare their relative performances. Of particular interest is the case of planar graphs. In the study described in this paper a set of 6000 planar graphs was generated using several different techniques. Each graph has between 20 and 200 vertices. These graphs were then used to compare the performance of ten different colouring algorithms. Results show clearly the advantage of the reduction algorithms for colouring planar graphs.

Received February 1983.

* Computer Science Department, Heriot-Watt University, 79 Grassmarket, Edinburgh EH1 2HJ, UK


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.