Planar L-Drawings of Directed Graphs
Data Structures and Algorithms
2017-09-05 v2 Computational Geometry
Abstract
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.
Cite
@article{arxiv.1708.09107,
title = {Planar L-Drawings of Directed Graphs},
author = {Steven Chaplick and Markus Chimani and Sabine Cornelsen and Giordano Da Lozzo and Martin Nöllenburg and Maurizio Patrignani and Ioannis G. Tollis and Alexander Wolff},
journal= {arXiv preprint arXiv:1708.09107},
year = {2017}
}
Comments
Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017)