Algorithmic Graph Theory CMPT 814 (3)
Algorithm design often stresses universal approaches for general problem instances. If the instances possess a special structure, more efficient algorithms are possible. This course will examine graphs and networks with special structure, such as chordal, interval, and permutation graphs, which allows the development of efficient algorithms for hard computational problems.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Pavol Hell |
Jan 5 – Apr 11, 2016: Tue, 10:30–11:20 a.m.
Jan 5 – Apr 11, 2016: Thu, 9:30–11:20 a.m. |
Burnaby Burnaby |