Description: Enough to assume that many of the arrangements for the venue where a number of activities, and want to use the venue as small as possible. The design of an effective arrangement of the greedy algorithm. ( this problem is actually the famous graph coloring problem. If every activity as a graph is a vertex, edge connected between incompatible activities. So that adjacent vertices with different colors corresponding to the least number of colors, to find the minimum number of venue
To Search:
File list (Check if you may need any files):
huichang.doc