Campus Event Calendar
Event Entry
What and Who
Cubic Augmentation of Planar Graphs
Ignaz Rutter
KIT Karlsruhe
AG1 Mittagsseminar (own work)
AG 1, RG1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 4 September 2012
13:00
30 Minutes
MPI-INF, Geb E1 4
023
Saarbrücken
Warning: New Room!
Abstract
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 efficient algorithm for the variant of the problem where the input graph has a fixed planar (topological) embedding that has to be preserved by the augmentation. We further generalize this algorithm to test efficiently whether a 3-regular planar augmentation exists that additionally makes the input graph connected or biconnected.
Contact
Carola Winzen
--email hidden
passcode not visible
logged in users only
Carola Winzen, 09/03/2012 16:55
Carola Winzen, 09/02/2012 11:15
Carola Winzen, 09/02/2012 11:15 -- Created document.
Carola Winzen, 09/02/2012 11:15
Carola Winzen, 09/02/2012 11:15 -- Created document.