@Misc{macau_mods_00002022,
  author = 	{R{\"u}egg, Ulf
		and von Hanxleden, Reinhard},
  title = 	{Wrapping layered graphs},
  year = 	{1992},
  publisher = 	{Institut f{\"u}r Informatik},
  address = 	{Kiel},
  volume = 	{1803},
  abstract = 	{We present additions to the widely-used layout method for directed acyclic graphs of Sugiyama et al. [16] that allow to better utilize a prescribed drawing area. The method itself partitions the graph's nodes into layers. When drawing from top to bottom, the number of layers directly impacts the height of a resulting drawing and is bound from below by the graph's longest path. As a consequence, the drawings of certain graphs are significantly taller than wide, making it hard to properly display them on a medium such as a computer screen without scaling the graph's elements down to illegibility. We address this with the Wrapping Layered Graphs Problem (WLGP), which seeks for cut indices that split a given layering into chunks that are drawn side-by-side with a preferably small number of edges wrapping backwards. Our experience and a quantitative evaluation indicate that the proposed wrapping allows an improved presentation of narrow graphs, which occur frequently in practice and of which the internal compiler representation SCG is one example.},
  issn = 	{2192-6247},
  url = 	{https://macau.uni-kiel.de/receive/macau_mods_00002022},
  file = 	{:https://macau.uni-kiel.de/servlets/MCRFileNodeServlet/macau_derivate_00003090/tr-1803.pdf:PDF},
  language = 	{en}
}