Upward Point Set Embeddability for Convex Point Sets is in $P$
Data Structures and Algorithms
2015-03-19 v1
Abstract
In this paper, we present a polynomial dynamic programming algorithm that tests whether a -vertex directed tree has an upward planar embedding into a convex point-set of size . Further, we extend our approach to the class of outerplanar digraphs. This nontrivial and surprising result implies that any given digraph can be efficiently tested for an upward planar embedding into a given convex point set.
Cite
@article{arxiv.1108.3092,
title = {Upward Point Set Embeddability for Convex Point Sets is in $P$},
author = {Michael Kaufmann and Tamara Mchedlidze and Antonios Symvonis},
journal= {arXiv preprint arXiv:1108.3092},
year = {2015}
}