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, May 07, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Manuel Wettstein

Algorithms for Counting and Enumerating Crossing-free Perfect Matchings on a Planar Point Set and Related Problems.

Let P be a set of n points in the plane, let M(P) be the set of crossing-free perfect matchings with vertex set P and edges embedded as straight line segments, and let pm(P) = |M(P)|. We present a counting algorithm which computes the number pm(P) in time O*(2^n), and we show how this algorithm can be modified such that the set M(P) is enumerated using polynomial time per enumerated object. Moreover, we briefly mention that the presented ideas can be generalized into an abstract framework, which gives rise to counting algorithms for many other types of geometric graphs, e.g. the set of all crossing-free geometric graphs, convex partitions, convex subdivisions, crossing-free spanning trees and crossing-free spanning cycles.

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