Upward Geometric Graph Embeddings into Point Sets

Angelini, P; Frati, F; Geyer, M; Kaufmann, M; Mchedlidze, T; Symvonis, A

dc.contributor.author	Angelini, P	en
dc.contributor.author	Frati, F	en
dc.contributor.author	Geyer, M	en
dc.contributor.author	Kaufmann, M	en
dc.contributor.author	Mchedlidze, T	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T02:52:32Z
dc.date.available	2014-03-01T02:52:32Z
dc.date.issued	2010	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35912
dc.subject	Computational Geometry	en
dc.subject	Directed Graph	en
dc.subject	Geometric Graph	en
dc.title	Upward Geometric Graph Embeddings into Point Sets	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-18469-7_3	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-18469-7_3	en
heal.publicationDate	2010	en
heal.abstract	We study the problem of characterizing the directed graphs with an upward straight-line embedding into every point set in general or in convex position. We solve two questions posed by Binucci et al. [Computational Geometry: Theory and Applications, 2010]. Namely, we prove that the classes of directed graphs with an upward straight-line embedding into every point set in convex position and	en
heal.journalName	Symposium on Graph Drawing	en
dc.identifier.doi	10.1007/978-3-642-18469-7_3	en