Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Ordered Greed, II: Graph Coloring Peter G. Anderson
 

Summary: Ordered Greed, II: Graph Coloring
Peter G. Anderson
Rochester Institute of Technology
Rochester, NY
anderson(at sign)cs.rit.edu
Abstract
A popular application of genetic algorithms (GAs) is to
attempt to generate good, rapid, approximate solutions
to NP-complete or NP-hard problems.
Previously, in [1], and [4], we introduced a hybrid al-
gorithm combining a GA with simple greedy algorithms
applied to the N-Queens problem and to sports tourna-
ment scheduling. The greedy algorithm makes locally
optimal assignments (to Queens or matches) in some
order. We treat that ordering as the sought after goal,
and thus work with a population whose individuals are
permutations.
The subject of the present paper is the problem of
graph coloring. We focus the present paper on the
single benchmark problem of coloring a three-colorable

  

Source: Anderson, Peter G. - Department of Computer Science, Rochester Institute of Technology

 

Collections: Computer Technologies and Information Sciences