voula@utcsri.UUCP (Voula Vanneli) (02/27/85)
UNIVERSITY OF TORONTO DEPARTMENT OF COMPUTER SCIENCE (SF = Sandford Fleming Building, 10 King's College Road) COLLOQUIUM - Tuesday, March 5, 11 a.m., SF 1105 Professor D. Corneil Dept. of Computer Science, University of Toronto 9 "Algorithms for Perfect Graphs" 9 _C_o_f_f_e_e _a_n_d _c_o_o_k_i_e_s _w_i_l_l _b_e _s_e_r_v_e_d. Abstract A great deal of the recent development in the area of serial graph theoretical algorithms has been in the area of perfect graphs. In this talk an overview of the applica- tions of perfect graphs and the techniques developed for their algorithms will be presented.