++++++++++++++++++++++++++++++++++++++++++++++
            +        Computer Science Seminar            +
            ++++++++++++++++++++++++++++++++++++++++++++++

0. Calendar Manager Info:

        Date:   7 Mar 1996
        Start:  1300
        End:    1400
        What:   ANU Comp. Sci. Seminar - Prof R Anstee
		Matching Theory: Fractional to Integral.
                
1. Speaker: Prof. Richard Anstee
            University of British Columbia

2. Time:     1:00pm-2:00pm, 7th March 1996 (Thursday)

3. Place:    Room N101, in the Department of Computer Science
             Ground Floor, CSIT building, ANU

4. Title:  Matching Theory: Fractional to Integral.

5. Target Audience: honours students and above

6. Abstract: 
    A subgraph H of a simple graph G=(V,E) can be viewed as a vector
    x=(x(e):e in E) where x(e)=1 if e is chosen to be in H and 
    x(e)=0 otherwise. We can extend this to `fractional subgraphs' by
    allowing x(e) to be any fraction between 0 and 1. This concept
    has been very fruitful in a variety of graph theory problems, both
    in developing fast algorithms and obtaining attractive existence 
    theorems.
 
    Applications to the plotter pen problem and to edge colouring should
    enliven the talk for non-specialists.

8. Contact:
	For more information contact bdm[at]cs.