Planar L-Drawings of Directed Graphs

Steven Chaplick; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Martin Nöllenburg; Maurizio Patrignani; Ioannis G. Tollis; Alexander Wolff

doi:10.1007/978-3-319-73915-1_36

Planar L-Drawings of Directed Graphs

Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo^*, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

Abstract

We study planar drawings of directed graphs in the l-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence of a planar l-drawing is an np-complete problem. Motivated by this result, we focus on upward-planar l-drawings. We show that directed st-graphs admitting an upward- (resp. Upward-rightward-) planar l-drawing are exactly those admitting a bitonic (resp. Monotonically increasing) st-ordering. We give a linear-time algorithm that computes a bitonic (resp. Monotonically increasing) st-ordering of a planar st-graph or reports that there exists none.keywordskandinsky modelvirtual edgevariable embedding settingpertinent graphdirected planar graphthese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Original language	English
Title of host publication	Drawing and Network Visualization. GD 2017
Pages	465-478
DOIs	https://doi.org/10.1007/978-3-319-73915-1_36
Publication status	Published - 2017
Externally published	Yes

Publication series

Series	Lecture Notes in Computer Science
Volume	10692
ISSN	0302-9743

Access to Document

10.1007/978-3-319-73915-1_36

1 Article

Planar L-Drawings of Directed Graphs
Chaplick, S., Chimani, M., Cornelsen, S., Da Lozzo, G., Nöllenburg, M., Patrignani, M., Tollis, I. G. & Wolff, A., 1 Nov 2023, In: Computing in Geometry and Topology. 2, 1, p. 7:1–7:15
Research output: Contribution to journal › Article › Academic › peer-review

Open Access

Cite this

@inproceedings{a50f794bffb0475ea2952e0390777f60,

title = "Planar L-Drawings of Directed Graphs",

abstract = "We study planar drawings of directed graphs in the l-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence of a planar l-drawing is an np-complete problem. Motivated by this result, we focus on upward-planar l-drawings. We show that directed st-graphs admitting an upward- (resp. Upward-rightward-) planar l-drawing are exactly those admitting a bitonic (resp. Monotonically increasing) st-ordering. We give a linear-time algorithm that computes a bitonic (resp. Monotonically increasing) st-ordering of a planar st-graph or reports that there exists none.keywordskandinsky modelvirtual edgevariable embedding settingpertinent graphdirected planar graphthese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.",

author = "Steven Chaplick and Markus Chimani and Sabine Cornelsen and Lozzo, {Giordano Da} and Martin N{\"o}llenburg and Maurizio Patrignani and Tollis, {Ioannis G.} and Alexander Wolff",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2017",

doi = "10.1007/978-3-319-73915-1_36",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "465--478",

booktitle = "Drawing and Network Visualization. GD 2017",

}

TY - GEN

T1 - Planar L-Drawings of Directed Graphs

AU - Chaplick, Steven

AU - Chimani, Markus

AU - Cornelsen, Sabine

AU - Lozzo, Giordano Da

AU - Nöllenburg, Martin

AU - Patrignani, Maurizio

AU - Tollis, Ioannis G.

AU - Wolff, Alexander

N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2017

Y1 - 2017

N2 - We study planar drawings of directed graphs in the l-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence of a planar l-drawing is an np-complete problem. Motivated by this result, we focus on upward-planar l-drawings. We show that directed st-graphs admitting an upward- (resp. Upward-rightward-) planar l-drawing are exactly those admitting a bitonic (resp. Monotonically increasing) st-ordering. We give a linear-time algorithm that computes a bitonic (resp. Monotonically increasing) st-ordering of a planar st-graph or reports that there exists none.keywordskandinsky modelvirtual edgevariable embedding settingpertinent graphdirected planar graphthese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

AB - We study planar drawings of directed graphs in the l-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence of a planar l-drawing is an np-complete problem. Motivated by this result, we focus on upward-planar l-drawings. We show that directed st-graphs admitting an upward- (resp. Upward-rightward-) planar l-drawing are exactly those admitting a bitonic (resp. Monotonically increasing) st-ordering. We give a linear-time algorithm that computes a bitonic (resp. Monotonically increasing) st-ordering of a planar st-graph or reports that there exists none.keywordskandinsky modelvirtual edgevariable embedding settingpertinent graphdirected planar graphthese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

U2 - 10.1007/978-3-319-73915-1_36

DO - 10.1007/978-3-319-73915-1_36

M3 - Conference article in proceeding

T3 - Lecture Notes in Computer Science

SP - 465

EP - 478

BT - Drawing and Network Visualization. GD 2017

ER -

Planar L-Drawings of Directed Graphs

Abstract

Publication series

Access to Document

Fingerprint

Research output

Planar L-Drawings of Directed Graphs

Cite this