Upward straight-line embeddings of directed graphs into point sets

Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G Kobourov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages122-133
Number of pages12
Volume5344 LNCS
DOIs
StatePublished - 2008
Event34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008 - Durham, United Kingdom
Duration: Jun 30 2008Jul 2 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5344 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008
CountryUnited Kingdom
CityDurham
Period6/30/087/2/08

Fingerprint

Directed graphs
Straight Line
Point Sets
Directed Graph
Hamiltonian Graph
Hamiltonians
Convex Sets
NP-complete problem
Path

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

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). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5344 LNCS). https://doi.org/10.1007/978-3-540-92248-3_12

Upward straight-line embeddings of directed graphs into point sets. / Estrella-Balderrama, Alejandro; Frati, Fabrizio; Kobourov, Stephen G.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5344 LNCS 2008. p. 122-133 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5344 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Estrella-Balderrama, A, Frati, F & Kobourov, SG 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, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5344 LNCS, pp. 122-133, 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008, Durham, United Kingdom, 6/30/08. https://doi.org/10.1007/978-3-540-92248-3_12
Estrella-Balderrama A, Frati F, Kobourov SG. 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. 2008. p. 122-133. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-92248-3_12
Estrella-Balderrama, Alejandro ; Frati, Fabrizio ; Kobourov, Stephen G. / Upward straight-line embeddings of directed graphs into point sets. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5344 LNCS 2008. pp. 122-133 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3605f90a5462409d91031385d956d7fd,
title = "Upward straight-line embeddings of directed graphs into point sets",
abstract = "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.",
author = "Alejandro Estrella-Balderrama and Fabrizio Frati and Kobourov, {Stephen G}",
year = "2008",
doi = "10.1007/978-3-540-92248-3_12",
language = "English (US)",
isbn = "3540922474",
volume = "5344 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "122--133",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Upward straight-line embeddings of directed graphs into point sets

AU - Estrella-Balderrama, Alejandro

AU - Frati, Fabrizio

AU - Kobourov, Stephen G

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=58349095889&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58349095889&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-92248-3_12

DO - 10.1007/978-3-540-92248-3_12

M3 - Conference contribution

AN - SCOPUS:58349095889

SN - 3540922474

SN - 9783540922476

VL - 5344 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 122

EP - 133

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -