Upward point set embeddability for convex point sets is in P

Kaufmann, M; McHedlidze, T; Symvonis, A

dc.contributor.author	Kaufmann, M	en
dc.contributor.author	McHedlidze, T	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T02:54:03Z
dc.date.available	2014-03-01T02:54:03Z
dc.date.issued	2012	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/36567
dc.subject.other	Directed trees	en
dc.subject.other	Dynamic programming algorithm	en
dc.subject.other	Point set	en
dc.subject.other	Decision trees	en
dc.subject.other	Drawing (graphics)	en
dc.subject.other	Dynamic programming	en
dc.subject.other	Trees (mathematics)	en
dc.subject.other	Geometry	en
dc.title	Upward point set embeddability for convex point sets is in P	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-25878-7_38	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-25878-7_38	en
heal.publicationDate	2012	en
heal.abstract	In this paper, we present a polynomial dynamic programming algorithm that tests whether a n-vertex directed tree T has an upward planar embedding into a convex point-set S of size n. We also note that our approach can be extended 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. © 2012 Springer-Verlag Berlin Heidelberg.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-642-25878-7_38	en
dc.identifier.volume	7034 LNCS	en
dc.identifier.spage	403	en
dc.identifier.epage	414	en