[ont.events] Series-Parallel Bounds for the Two-terminal Reliability Problem.

ylfink@water.waterloo.edu (ylfink) (01/18/88)

DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

COMBINATORIAL ALGORITHMS SEMINAR

                    - Thursday, January 21, 1988

Mr.  Hosam  AboEL  Fotoh,  a  graduate  student of this
department,  will speak on ``Series-Parallel Bounds for
the Two-terminal Reliability Problem''.

TIME:                10:30 AM

ROOM:              MC 2035

ABSTRACT

The  two-terminal  reliability problem of communication
networks  with  unreliable  links  is a computationally
difficult  problem.  Upper  and  lower  bounds  can  be
efficiently computed using graph-theoretical techniques
based  on  edge-packing.  We present new techniques for
improving  these  bounds  via  approximation by series-
parallel graphs.