Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, March 04, 2021, 12:15 pm
Duration: 30 minutes
Location: Zoom: conference room
Speaker: Tim Taubner
Greedy graph drawings are characterized by the ability to perform greedy routing: A message with known geometric destination is simply forwarded to a neighbor closer to the destination. The path this message takes forms a so-called greedy path: A path where each vertex is closer to the destination than its predecessor(s). The drawback is that the length of a greedily paths could be unbounded in terms of the distance between start and target. Recently, stricter versions of greedy drawings have been proposed, which bound the detour by imposing further constraints on the path. In this talk I will present these classes of graph drawings, namely (weakly) self-approaching and increasing-chord drawings and survey what is known to date.
Automatic MiSe System Software Version 1.4803M | admin login