Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, November 16, 2010, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Abel Guardian Camacho (45m, student GD)
A natural way to draw two planar graphs whose vertex sets are matched is to assign each matched pair a unique y-coordinate. Di Giacomo et al. introduced the concept of such matched drawings, which are a relaxation of simultaneous geometric embeddings with mapping. We review their results and, in particular, show that (i) two 3-connected planar graphs may not be matched drawable, while (ii) two trees are always matched drawable.
Automatic MiSe System Software Version 1.4803M | admin login