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, January 29, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Emo Welzl

Upward Planar Orientations of Maximal Planar Graphs

An embedding of a graph G in the plane is called an upward drawing, if every edge is represented by a y-monotone Jordan curve, and it is called plane, if no two such curves meet other than at common endpoints. Such an upward drawing induces an orientation of the edges of G (where the notion ”upward” even indicates which direction we want to go) – this gives a directed graph G. We discuss the problem of determining the maximum and the minimum number of upward planar orientations a maximal planar graph can have (and we even indicate where the question came from, even though this turned out to be a dead end). We show that every maximal planar graph (triangulation) has at most O(4n poly(n)) upward planar orientations, n the number of vertices of the graph. (Other bounds to be mentioned are that every maximal planar graph has at least Omega(1.189n) upward planar orientations and that there exist maximal planar graphs having as few as O(2n) upward planar orientations and maximal planar graphs having as many as Omega(2.599n) upward planar orientations - from joint work with Fabrizio Frati and Joachim Gudmundsson.)

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