New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity
Bläsius, Thomas
Abstract:
Drawings of graphs are often used to represent a given data set in a human-readable way. In this thesis, we consider different classic algorithmic problems that arise when automatically generating graph drawings. More specifically, we solve some open problems in the context of orthogonal drawings and advance the current state of research on the problems clustered planarity and simultaneous planarity.
| Zugehörige Institution(en) am KIT | Institut für Theoretische Informatik (ITI) |
| Publikationstyp | Hochschulschrift |
| Publikationsjahr | 2015 |
| Sprache | Englisch |
| Identifikator | urn:nbn:de:swb:90-488795 KITopen-ID: 1000048879 |
| Verlag | Karlsruher Institut für Technologie (KIT) |
| Art der Arbeit | Dissertation |
| Fakultät | Fakultät für Informatik (INFORMATIK) |
| Institut | Institut für Theoretische Informatik (ITI) |
| Prüfungsdaten | 15.07.2015 |
| Schlagwörter | graph drawing, orthogonal, planarity, algorithms, computational complexity |
| Referent/Betreuer | Wagner, D. |