Building blocks of upward planar digraphs

Research output: Contribution to journal › Conference article › peer-review

Abstract

We show that a digraph is upward planar if and only if its biconnected components have certain properties.

Original language	English
Pages (from-to)	296-306
Number of pages	11
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3383
Publication status	Published - 2004
Event	12th International Symposium on Graph Drawing, GD 2004 - New York, NY, United States Duration: 29 Sep 2004 → 2 Oct 2004

@article{5114fd47d62b4f0dbb1489a6261c586e,

title = "Building blocks of upward planar digraphs",

abstract = "We show that a digraph is upward planar if and only if its biconnected components have certain properties.",

author = "Patrick Healy and Karol Lynch",

year = "2004",

language = "English",

volume = "3383",

pages = "296--306",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

note = "12th International Symposium on Graph Drawing, GD 2004 ; Conference date: 29-09-2004 Through 02-10-2004",

}

TY - JOUR

T1 - Building blocks of upward planar digraphs

AU - Healy, Patrick

AU - Lynch, Karol

PY - 2004

Y1 - 2004

N2 - We show that a digraph is upward planar if and only if its biconnected components have certain properties.

AB - We show that a digraph is upward planar if and only if its biconnected components have certain properties.

UR - https://www.scopus.com/pages/publications/24144445381

M3 - Conference article

AN - SCOPUS:24144445381

SN - 0302-9743

VL - 3383

SP - 296

EP - 306

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

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

T2 - 12th International Symposium on Graph Drawing, GD 2004

Y2 - 29 September 2004 through 2 October 2004

ER -