Practical level planarity testing and layout with embedding constraints

Martin Harrigan; Patrick Healy

doi:10.1007/978-3-540-77537-9_9

Practical level planarity testing and layout with embedding constraints

Martin Harrigan, Patrick Healy

University of Limerick

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

Abstract

We describe a practical method to test a leveled graph for level planarity and provide a level planar layout of the graph if the test succeeds, all in quadratic running-time. Embedding constraints restricting the order of incident edges around the vertices are allowed.

Original language	English
Title of host publication	Graph Drawing - 15th International Symposium, GD 2007, Revised Papers
Pages	62-68
Number of pages	7
DOIs	https://doi.org/10.1007/978-3-540-77537-9_9
Publication status	Published - 2008
Event	15th International Symposium on Graph Drawing, GD 2007 - Sydney, Australia Duration: 24 Sep 2007 → 26 Sep 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4875 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th International Symposium on Graph Drawing, GD 2007
Country/Territory	Australia
City	Sydney
Period	24/09/07 → 26/09/07

Access to Document

10.1007/978-3-540-77537-9_9

Cite this

Harrigan, M., & Healy, P. (2008). Practical level planarity testing and layout with embedding constraints. In Graph Drawing - 15th International Symposium, GD 2007, Revised Papers (pp. 62-68). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4875 LNCS). https://doi.org/10.1007/978-3-540-77537-9_9

@inproceedings{80f4fa8ea89941819033bb6f61a1cefa,

title = "Practical level planarity testing and layout with embedding constraints",

abstract = "We describe a practical method to test a leveled graph for level planarity and provide a level planar layout of the graph if the test succeeds, all in quadratic running-time. Embedding constraints restricting the order of incident edges around the vertices are allowed.",

author = "Martin Harrigan and Patrick Healy",

year = "2008",

doi = "10.1007/978-3-540-77537-9_9",

language = "English",

isbn = "3540775366",

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

pages = "62--68",

booktitle = "Graph Drawing - 15th International Symposium, GD 2007, Revised Papers",

note = "15th International Symposium on Graph Drawing, GD 2007 ; Conference date: 24-09-2007 Through 26-09-2007",

}

Harrigan, M & Healy, P 2008, Practical level planarity testing and layout with embedding constraints. in Graph Drawing - 15th International Symposium, GD 2007, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4875 LNCS, pp. 62-68, 15th International Symposium on Graph Drawing, GD 2007, Sydney, Australia, 24/09/07. https://doi.org/10.1007/978-3-540-77537-9_9

Practical level planarity testing and layout with embedding constraints. / Harrigan, Martin; Healy, Patrick.
Graph Drawing - 15th International Symposium, GD 2007, Revised Papers. 2008. p. 62-68 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4875 LNCS).

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

TY - GEN

T1 - Practical level planarity testing and layout with embedding constraints

AU - Harrigan, Martin

AU - Healy, Patrick

PY - 2008

Y1 - 2008

N2 - We describe a practical method to test a leveled graph for level planarity and provide a level planar layout of the graph if the test succeeds, all in quadratic running-time. Embedding constraints restricting the order of incident edges around the vertices are allowed.

AB - We describe a practical method to test a leveled graph for level planarity and provide a level planar layout of the graph if the test succeeds, all in quadratic running-time. Embedding constraints restricting the order of incident edges around the vertices are allowed.

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

U2 - 10.1007/978-3-540-77537-9_9

DO - 10.1007/978-3-540-77537-9_9

M3 - Conference contribution

AN - SCOPUS:49949110607

SN - 3540775366

SN - 9783540775362

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

SP - 62

EP - 68

BT - Graph Drawing - 15th International Symposium, GD 2007, Revised Papers

T2 - 15th International Symposium on Graph Drawing, GD 2007

Y2 - 24 September 2007 through 26 September 2007

ER -

Practical level planarity testing and layout with embedding constraints

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this