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, January 10, 2006, 12:15 pm

**Duration**: This information is not available in the database

**Location**: This information is not available in the database

**Speaker**: Maria Chudnovsky (Princeton Univ./CMI)

Recently a few new results appeared, providing polynomial time algorithms for testing if a given graph contains certain induced subgraphs (such as "pyramids", odd odd cycles and anticycles, and some others). However, some seemingly similar problems (such as testing for the presence of an induced cycle passing through two given vertices, or testing for "prisms") are known to be NP-complete. At the moment it is not clear what causes this difference. A "theta" is a graph consisting of three vertex disjoint induced paths between two fixed vertices (the "ends"), such that there are no edges between the interiors of different paths. In joint work with Paul Seymour we were able to find a polynomial time algorithm to test if a graph contains a theta. In fact, we prove a stronger result, that provides a necessary and sufficient condition for a graph to contain a theta with a given end. We prove that a graph G does not contain a theta with a given end v, if and only if G has a certain structure; which can be tested for in polynomial time.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 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