Department of Computer Science

1/22/1998

3:45pm-4:45pm

The motivation for this talk comes from communications networks like the Internet and telephone switching networks. These networks must tolerate various failures. We discuss how to enhance tolerance of link failures. We propose a new graph model for this problem and present an optimal solution.

More precisely the talk centers on the edge-connectivity of graphs, and how to increase it in an optimum way. A formulation of this problem with a good solution was given in the late 80's. But the natural next step involved an NP-hard problem. We take the next step, by proposing a different problem and solving it optimally. The solution centers around a new min-max formula that generalizes the previous results. The new formula has an infinite number of exceptional cases! An efficient algorithm follows. We close the talk by presenting an application of our work to statics, specifically to the problem of bracing certain frameworks.

We give all the graph theory background needed to make this talk self-contained.

*Refreshments will be served immediately before the talk at 3:30pm.*

Department of Computer Science

University of Colorado Boulder

Boulder, CO 80309-0430 USA

webmaster@cs.colorado.edu

University of Colorado Boulder

Boulder, CO 80309-0430 USA

webmaster@cs.colorado.edu