Chromatic scheduling
A classical problem in combinatorics and combinatorial optimization is the graph coloring problem, which asks for the smallest number of colors required to color the vertices of a graph so that adjacent vertices receive distinct colors. Graph coloring arises in several applications of scheduling and...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
University of Iowa
2007
|
| Subjects: | |
| Online Access: | https://ir.uiowa.edu/etd/156 https://ir.uiowa.edu/cgi/viewcontent.cgi?article=1341&context=etd |