A Graph Coloring Algorithm and a Scheduling Problem.
Abstract
The graph coloring problem is defined, and its importance in several applications is noted. A new algorithm to color graphs is presented and tested against the Welch-Powell algorithm. Significantly better results are obtained on a sequence of three hundred randomly generated graphs. The new algorithm is applied to the solution of a scheduling problem. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1971
- Accession Number
- AD0727666
Entities
People
- Robert Albert Draper
Organizations
- Naval Postgraduate School