Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Tuesday, April 09, 2013, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Gianpaolo Oriolo (Università degli Studi di Roma)
The (weighted) independent set problem in claw-free graphs is a fundamental generalization of the matching problem. In fact, claw-free graphs are a superclass of line graphs, and the (weighted) independent set problem in line graphs is equivalent to the (weighted) matching problem. Building upon the current state-of-the-art algorithm for the weighted matching problem (by Gabow), the weighted independent set problem in a line graph G(V,E) can be solved in time O(|V|^2 log(|V|)). In this talk, we will quickly surf through a few algorithms that have been proposed for the problem, starting from the classical algorithm from 1980 due to Minty, passing by the elegant algorithm for the unweighted case due Lov\'asz and Plummer in 1986. Our journey will take us to the current state-of-the-art algorithm for the problem, that exploits a decomposition technique due to Chudnovsky and Seymour and finds a maximum weighted independent set in a claw-free graph G(V,E) in time O(|V|^3). We will revise this powerful technique and discuss how to apply similar ideas to go beyond claw-free graphs or beyond the independent set problem.
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