coloring 3/16/121. flight gates flights need gates, but times overlap. how many gates needed?...
TRANSCRIPT
1
Coloring
3/16/12
2
Flight Gates
flights need gates, but times overlap. how many gates needed?
3/16/12
3
Airline Schedule
122145 67257306 99
Flights
time
3/16/12
4
Conflicts Among 3 Flights
99
145
306
Needs gate at same time
3/16/12
5
Model all Conflicts with a Graph
257
67
99
145
306
122
3/16/12
6
Color vertices so that adjacent
vertices have different colors.
min # distinct colors needed =
min # gates needed
Color the vertices
3/16/12
7
Coloring the Vertices
257, 67122,14599306
4 colors4 gates
assigngates:
257
67
99
145
306
122
3/16/12
8
Better coloring
3 colors3 gates
257
67
99
145
306
122
3/16/12
9
Final Exams
Courses conflict if student takes both, so need different time slots.
How short an exam period?
3/16/12
10
Harvard’s SolutionDifferent “exam group” for every teaching hour. Exams for different groups at different times.
3/16/12
113/16/12
12
But This May be Suboptimal
• Suppose course A and course B meet at different times
• If no student in course A is also in course B, then their exams could be simultaneous
• Maybe exam period can be compressed!
• (Assuming no simultaneous enrollment)
3/16/12
13
Model as a Graph
CS 20
Psych 1201
Celtic 101
Music 127r
AM 21b
M 9amM 2pmT 9amT 2pm4 time slots
(best possible)
A B
Means A and B have at least one student in common
3/16/12
14
Map Coloring
3/16/12
15
Planar Four Coloring
any planar map is 4-colorable.1850’s: false proof published (was correct for 5 colors).
1970’s: proof with computer1990’s: much improved
3/16/12
16
Chromatic Number
min #colors for G is
chromatic number, χ(G)
lemma:
χ(tree) = 23/16/12
17
Pick any vertex as “root.”if (unique) path from root iseven length: odd length:
Trees are 2-colorable
root
3/16/12
18
Simple Cycles
χ(Ceven) = 2
χ(Codd) = 3
3/16/12
19
Bounded Degree
all degrees ≤ k, implies
very simple algorithm…
χ(G) ≤ k+1
3/16/12
20
“Greedy” Coloring…color vertices in any order. next vertex gets a color different from its neighbors. ≤ k neighbors, so k+1 colors always work3/16/12
21
coloring arbitrary graphs
2-colorable? --easy to check3-colorable? --hard to check (even if planar)find χ(G)? --theoretically no harder than 3-color, but harder in practice
3/16/12
22
Finis
3/16/12