12:30 p.m., Thursday (November 15, 2007)
Math Annex 1100
CRC Tier 1 Chair, Computer Science, McGill University
Rooted Routing Via Graph Minors
Abstract: Mankind has been interested in finding ways of getting from place
to place since the dawn of civilization. The Romans built roads, the
Chinese sailed junks, Dorothy clicked her heels. Mathematicians settle
for studying graphs. We discuss efficient algorithms for a variety of
routing problems on graphs, and the deep structural theory underlying
these algorithms. The talk is intended for a general audience. It
begins with the definition of the word graph.
Refreshments will be served at 12:15 p.m. (Math Lounge, MATX 1115).