Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Friday, December 04, 2015, 12:15 pm
Duration: 30 minutes
Location: CAB G11
Speaker: Michael Kaufmann (Universität Tübingen)
In a book embedding, the vertices of a graph are placed on the spine of a book and the edges are assigned to pages, so that edges of the same page do not cross. In 1986, Yannakakis gave a very complicated algorithm for book embedding any given planar graph on four pages. It is open since then, whether four pages are necessary or three pages suffice.
I will present our approach to this problem by means of SAT solving, discuss the (mostly negative) findings and show how we developed new hypotheses that might help to solve this problem and some related ones.
Automatic MiSe System Software Version 1.4803M | admin login