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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, June 26, 2007, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Subir Ghosh (Tata Institute of Fundamental Research, Mumbai, India)

Computing the maximum clique in visibility graphs

The problem of computing the maximum clique in a visibility graph in polynomial time is a longstanding open problem in geometric graph theory. In this talk, we present a polynomial time algorithm for computing the maximum clique in the visibility graph G of a simple polygon P, under the assumption that the Hamiltonian cycle in G, that corresponds to the boundary of P, is given as an input to the algorithm along with G. Note that the maximum clique in G corresponds to the largest empty convex polygon in P.


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

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