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, September 17, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Alexander Pilz (TU Graz)

Good Drawings: Enumeration and Pseudo-Linearity

In this talk, we consider so-called good drawings of the complete graph, which are drawings where two edges intersect at most once, and which are therefore considered to be a generalization of geometric graphs. We discuss isomorphism classes and of such drawings and present our approach for exhaustively generating all isomorphism classes with few vertices. A good drawing is pseudo-linear if each edge can be simultaneously extended to a pseudo-line in a pseudo-line arrangement. We discuss properties of pseudo-linear drawings and sketch a proof showing that a simple property is necessary and sufficient for a good drawing to be pseudo-linear.

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