Sunday, January 9

Session 2: Invited Presentation
Digraph Minors and Algorithms

11:00 AM-12:00 PM
Room: Gold Rush A

The Graph Minors project, originated by Robertson and Seymour, was very successful. It resulted in many theoretical advances (e.g. a proof of Wagner's conjecture), but it also has algorithmic applications, and some of the methods have been successfully used in practical computation.

It now appears possible to extend part of the project to directed graphs. The speaker will review the basics of the Graph Minors theory, and then will discuss generalizations to directed graphs, algorithmic consequences, and open problems.

Robin Thomas
Georgia Institute of Technology

© 1999, Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 11/7/99; Last Updated 11/7/99