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: Thursday, December 02, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Georgios Mertzios (TU München)

The Fixed-Parameter Cluster-Detecting Problem and applications

We handle here the complexity of the fixed-parameter cluster-detecting problem. This problem concerns the determination of a subgraph of a certain size and a certain constant density. The only known algorithm yet solves this problem in time O(n2c+4), when applied to a graph on n nodes and m edges, where c is the fixed parameter of the problem. We present here two improved algorithms with complexity O(n2c+2) and O(min{n2c+2,nm2c+2+nc+4}) in worst case respectively. The second of these algorithms is essentially better for sparser graphs. The first one is also applied to the problem of measuring the design complexity, obtaining thus complexity O(n2c) in worst case for that problem.


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