Skip Navigation

The Computer Journal 1989 32(5):474-476; doi:10.1093/comjnl/32.5.474
© 1989 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 (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ellis, J. A.
Right arrow Articles by Lepolesa, P. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Note

A Las Vegas graph Colouring Algorithm

J. A. Ellis1 * and P. M. Lepolesa2 §

1 Department of Computer Science, University of Victoria, Victoria, British Columbia V8W 2Y2, Canada, 2 National University of Lesotho, Lesotho, South Africa

It is known that for some NP-complete problem, most instances of the problem can be solved in polynomial time. The classic graph colouring problem is an example for which Monte Carlo algorithms have been given. These algorithms always terminate in polynomial time, and almost always give the correct result. That is to say, as the size of the correct result. That is to say, as the size of the graph tends to infinity, the probability of the algorithm giving a wrong answer on a random graph tends to zero. Here we describe a Las Vegas algorithm for the same problem. This kind of algorithm always gives the correct result and almost always terminates in polynomial time. The algorithm is based on a traversal of a Zykov tree derived from the graph and uses results previously obtained for a Monte Carlo algorithm for the same problem.

Received June 1988. accepted February 1989.

* Department of Computer Science, University of Victoria, Victoria, British Columbia V8W 2Y2, Canada

§ National University of Lesotho, Lesotho


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.