Talks and Poster Presentations (with Proceedings-Entry):
S. Chaplick, M. Chimani, S. Cornelsen, G. Da Lozzo, M. Nöllenburg, M. Patrignani, I. Tollis, A. Wolff:
"Planar L-Drawings of Directed Graphs";
Talk: International Symposium on Graph Drawing and Network Visualization (GD),
- 2017-09-27; in: "Graph Drawing and Network Visualization (GD 2017)",
F. Frati, K.-L. Ma (ed.);
Springer Lecture Notes in Computer Science,
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence of a planar L-drawing is an NP-complete problem. Motivated by this result, we focus on upward-planar L-drawings. We show that directed st-graphs admitting an upward- (resp. upward-rightward-) planar L-drawing are exactly those admitting a bitonic (resp. monotonically increasing) st-ordering. We give a linear-time algorithm that computes a bitonic (resp. monotonically increasing) st-ordering of a planar st-graph or reports that there exists none.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.