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: Thursday, February 23, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Masashi Kiyomi (National Institute of Informatics (NII)

Enumerating Chordal Graphs

In this talk, we address the problem of enumerating all chordal subgraphs in a given graph. Graph is chordal iff it has no induced chordless cycle of length more than three. We introduce an algorithm to enumerate all chordal subgraphs in an n-vertices complete graph. Then, we show that we can use, with small changes, these algorithms to generate all (connected or not necessarily connected) chordal subgraphs in arbitrary graph. Our algorithms are based on reverse search method, and time complexities to generate a chordal graph are O(1).

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