Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, July 27, 2006, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Marek Sulovský (Charles Univ., Prague)
T-paths in graphs are generalizations of matchings. We will make a
brief introduction to this topic and related packing problems as well
as their recent generalizations - non-zero paths in group-labeled
graphs and non-returning paths in permutation-labeled graphs. We will
discuss possibilities of further generalizations of recent results in
those two topics.
At last we will have a look at linear programming formulations of some of the T-path packing problems.
Automatic MiSe System Software Version 1.4803M | admin login