Campus Event Calendar
Event Entry
What and Who
Computing the stable set in a t-perfect graph
Stefan Funke
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 25 July 2002
13:30
45 Minutes
Warning: Date has changed!
46.1 - MPII
024
Saarbrücken
Abstract
We show how to compute the stable set of a $t$-perfect graph
in polynomial time using a combinatorial algorithm.
Joint work with F.Eisenbrand, N.Garg, and J.Koenemann.
Contact
Stefan Funke
--email hidden
passcode not visible
logged in users only