Characterization of level non-planar graphs by minimal patterns

Patrick Healy; Ago Kuusik; Sebastian Leipert

doi:10.1007/3-540-44968-x_8

Characterization of level non-planar graphs by minimal patterns

Patrick Healy, Ago Kuusik, Sebastian Leipert

Department of Computer Science & Information Systems

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

Abstract

In this paper we give a characterization of level planar graphs in terms of minimal forbidden subgraphs called minimal level non-planar subgraph patterns (MLNP). We show that a MLNP is completely characterized by either a tree, a level non-planar cycle or a level planar cycle with certain path augmentations. These characterizations are an important rst step towards attacking the NP-hard level planarization problem.

Original language	English
Title of host publication	Computing and Combinatorics - 6th Annual International Conference, COCOON 2000, Proceedings
Editors	Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma
Publisher	Springer Verlag
Pages	74-84
Number of pages	11
ISBN (Print)	3540677879, 9783540677871
DOIs	https://doi.org/10.1007/3-540-44968-x_8
Publication status	Published - 2000
Event	6th Annual International Conference on Computing and Combinatorics, COCOON 2000 - Sydney, Australia Duration: 26 Jul 2000 → 28 Jul 2000

Publication series

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

Conference

Conference	6th Annual International Conference on Computing and Combinatorics, COCOON 2000
Country/Territory	Australia
City	Sydney
Period	26/07/00 → 28/07/00

Access to Document

10.1007/3-540-44968-x_8

Cite this

Healy, P., Kuusik, A., & Leipert, S. (2000). Characterization of level non-planar graphs by minimal patterns. In D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, & A. Sharma (Eds.), Computing and Combinatorics - 6th Annual International Conference, COCOON 2000, Proceedings (pp. 74-84). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1858). Springer Verlag. https://doi.org/10.1007/3-540-44968-x_8

Healy, Patrick ; Kuusik, Ago ; Leipert, Sebastian. / Characterization of level non-planar graphs by minimal patterns. Computing and Combinatorics - 6th Annual International Conference, COCOON 2000, Proceedings. editor / Ding-Zhu Du ; Peter Eades ; Vladimir Estivill-Castro ; Xuemin Lin ; Arun Sharma. Springer Verlag, 2000. pp. 74-84 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7325ec655840499c95b6a85a087eb702,

title = "Characterization of level non-planar graphs by minimal patterns",

abstract = "In this paper we give a characterization of level planar graphs in terms of minimal forbidden subgraphs called minimal level non-planar subgraph patterns (MLNP). We show that a MLNP is completely characterized by either a tree, a level non-planar cycle or a level planar cycle with certain path augmentations. These characterizations are an important rst step towards attacking the NP-hard level planarization problem.",

author = "Patrick Healy and Ago Kuusik and Sebastian Leipert",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 6th Annual International Conference on Computing and Combinatorics, COCOON 2000 ; Conference date: 26-07-2000 Through 28-07-2000",

year = "2000",

doi = "10.1007/3-540-44968-x_8",

language = "English",

isbn = "3540677879",

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

publisher = "Springer Verlag",

pages = "74--84",

editor = "Ding-Zhu Du and Peter Eades and Vladimir Estivill-Castro and Xuemin Lin and Arun Sharma",

booktitle = "Computing and Combinatorics - 6th Annual International Conference, COCOON 2000, Proceedings",

}

Healy, P, Kuusik, A & Leipert, S 2000, Characterization of level non-planar graphs by minimal patterns. in D-Z Du, P Eades, V Estivill-Castro, X Lin & A Sharma (eds), Computing and Combinatorics - 6th Annual International Conference, COCOON 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1858, Springer Verlag, pp. 74-84, 6th Annual International Conference on Computing and Combinatorics, COCOON 2000, Sydney, Australia, 26/07/00. https://doi.org/10.1007/3-540-44968-x_8

Characterization of level non-planar graphs by minimal patterns. / Healy, Patrick; Kuusik, Ago; Leipert, Sebastian.
Computing and Combinatorics - 6th Annual International Conference, COCOON 2000, Proceedings. ed. / Ding-Zhu Du; Peter Eades; Vladimir Estivill-Castro; Xuemin Lin; Arun Sharma. Springer Verlag, 2000. p. 74-84 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1858).

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

TY - GEN

T1 - Characterization of level non-planar graphs by minimal patterns

AU - Healy, Patrick

AU - Kuusik, Ago

AU - Leipert, Sebastian

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2000.

PY - 2000

Y1 - 2000

N2 - In this paper we give a characterization of level planar graphs in terms of minimal forbidden subgraphs called minimal level non-planar subgraph patterns (MLNP). We show that a MLNP is completely characterized by either a tree, a level non-planar cycle or a level planar cycle with certain path augmentations. These characterizations are an important rst step towards attacking the NP-hard level planarization problem.

AB - In this paper we give a characterization of level planar graphs in terms of minimal forbidden subgraphs called minimal level non-planar subgraph patterns (MLNP). We show that a MLNP is completely characterized by either a tree, a level non-planar cycle or a level planar cycle with certain path augmentations. These characterizations are an important rst step towards attacking the NP-hard level planarization problem.

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

U2 - 10.1007/3-540-44968-x_8

DO - 10.1007/3-540-44968-x_8

M3 - Conference contribution

AN - SCOPUS:84957016109

SN - 3540677879

SN - 9783540677871

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

SP - 74

EP - 84

BT - Computing and Combinatorics - 6th Annual International Conference, COCOON 2000, Proceedings

A2 - Du, Ding-Zhu

A2 - Eades, Peter

A2 - Estivill-Castro, Vladimir

A2 - Lin, Xuemin

A2 - Sharma, Arun

PB - Springer Verlag

T2 - 6th Annual International Conference on Computing and Combinatorics, COCOON 2000

Y2 - 26 July 2000 through 28 July 2000

ER -

Healy P, Kuusik A, Leipert S. Characterization of level non-planar graphs by minimal patterns. In Du DZ, Eades P, Estivill-Castro V, Lin X, Sharma A, editors, Computing and Combinatorics - 6th Annual International Conference, COCOON 2000, Proceedings. Springer Verlag. 2000. p. 74-84. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44968-x_8

Characterization of level non-planar graphs by minimal patterns

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this