In this paper we consider the problem of characterizing the directed graphs that admit an upward straight-line embedding into every point set in convex or in general position. In particular, we show that no biconnected directed graph admits an upward straight-line embedding into every point set in convex position, and we provide a characterization of the Hamiltonian directed graphs that admit upward straight-line embeddings into every point set in general or in convex position. We also describe how to construct upward straight-line embeddings of directed paths into convex point sets and we prove that for directed trees such embeddings do not always exist. Further, we investigate the related problem of upward simultaneous embedding without mapping, proving that deciding whether two directed graphs admit an upward simultaneous embedding without mapping is NP-hard. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Estrella-Balderrama, A., Frati, F., & Kobourov, S. G. (2008). Upward straight-line embeddings of directed graphs into point sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5344 LNCS, pp. 122–133). https://doi.org/10.1007/978-3-540-92248-3_12
Mendeley helps you to discover research relevant for your work.