Department of Computer Science | Institute of Theoretical Computer Science | CADMO
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.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login