Example: stock market

Scheduling, Map Coloring, and Graph Coloring

Graph Coloring and Scheduling • Convert problem into a graph coloring problem. • Courses are represented by vertices. • Two vertices are connected with an edge if the corresponding courses have a student in common. 1007 3137 3157 3203 4115 3261 4156 4118

Tags:

  Graph, A graph

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Transcription of Scheduling, Map Coloring, and Graph Coloring

Related search queries