Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Wednesday, September 12, 2012, 12:15 pm
Duration: 30 minutes
Location: NO C44
Speaker: Ignaz Rutter (Karlsruhe Institute of Technology (KIT))
We study the problem of augmenting a planar graph such that it becomes 3-regular and remains planar. We show that it is NP-hard to decide whether such an augmentation exists. On the other hand, we give an efﬁcient algorithm for the variant of the problem where the input graph has a ﬁxed planar (topological) embedding that has to be preserved by the augmentation. We further generalize this algorithm to test efﬁciently whether a 3-regular planar augmentation exists that additionally makes the input graph connected or biconnected.
Automatic MiSe System Software Version 1.4803M | admin login