Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, September 28, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Michael Hoffmann

Chordless Paths and Cycles

Given a simple undirected graph G=(V,E), a positive integer k, and three distinct vertices s, t, and v from V, is there a chordless path from s via v to t in G that consists of at most k vertices? In a chordless path, no two vertices are connected by an edge that is not in the path. (Such paths are also known as induced paths.)

I will discuss the complexity of this problem that has been raised in the context of service deployment in communication networks. In particular, I will show that it is "unlikely" that this problem can be solved in f(k)*p(n) time, for some arbitrary (e.g., doubly exponential) function f and some polynomial p.

Similar results can be obtained for a number of related problems about chordless paths, for example, for deciding on the existence of a single directed chordless (s,t)-path in a digraph.

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

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