000K  utf8
1100  $c2017
1500  eng
2050  urn:nbn:de:gbv:8:1-zs-00000294-a0
3000  Rüegg, Ulf
3010  Adolf, Marc
3010  Cyruk, Michael
3010  Flohr, Astrid Mariana
3010  von Hanxleden, Reinhard
4000  Minimum-width graph layering revisited  [Rüegg, Ulf]
4209  The minimum-width layering problem tackles one step of a layout pipeline to create top-down drawings of directed acyclic graphs. Thereby, it aims at keeping the overall width of the drawing small. We study layering heuristics for this problem as presented by Nikolov et al. as well as traditional layering methods with respect to the questions how close they are to the true minimal width and how well they perform in practice, especially, if a particular drawing area is prescribed. We find that when applied carefully and at the right moment the layering heuristics can, compared to traditional layering methods, produce better layerings for prescribed drawing areas and for graphs with varying node dimensions. Still, we also find that there is room for improvement.
4950  https://nbn-resolving.org/urn:nbn:de:gbv:8:1-zs-00000294-a0$xR$3Volltext$534
4961  https://macau.uni-kiel.de/receive/macau_mods_00002017
5051  004