Tuesday, July 14

Well Structured Graphs and Algorithms

10:30 AM-12:30 PM
Room: Sidney Smith 2118

This minisymposium will focus on some new directions in graph algorithms. The speakers will present three main topics: graph decomposition algorithms, newly discovered properties of the Lexicographic Breadth First Search (LexBFS), and algorithmic aspects of some restricted matchings.

Organizer:Michel Habib
Université Montpellier II/CNRS, France
10:30 Uniquely Restricted Matchings
Martin C. Golumbic, Tirza Hirst, and Moshe Lewenstein, Bar Ilan University, Israel
11:00 On the Power of LexBFS
Andreas Bransdtädt and Feodor F. Dragan, University of Rostock, Germany
11:30 P-Connectedness, Graph Decompositions, and Applications
Stephan Olariu, Old Dominion University
12:00 Modular Decomposition and Graph Partitioning
Michel Habib, Organizer; Ross M. McConnell, University of Colorado, Denver; Christophe Paul, Université Montpellier II/CNRS, France; Jeremy P. Spinrad, Vanderbilt University; and Laurent Viennot, LIAFA, France
Program Program Overview Program-at-a-Glance Program Updates Speaker Index Registration Hotel Transportation

LMH, 2/23/98; MMD, 5/29/98