An application of well-orderly trees in graph drawing

Huaming Zhang; Xin He

doi:10.1007/11618058_41

An application of well-orderly trees in graph drawing

Huaming Zhang
, Xin He

Department of Computer Science and Engineering

University of Alabama in Huntsville

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

7 Scopus citations

Abstract

Well-orderly trees seem to have the potential of becoming a powerful technique capable of deriving new results in graph encoding, graph enumeration and graph generation [3, 4]. In this paper, we reduce the height of the visibility representation of plane graphs from 5n/6 to (4n -1)/5, by using well-orderly trees.

Original language	English
Title of host publication	Graph Drawing - 13th International Symposium, GD 2005, Revised Papers
Publisher	Springer Verlag
Pages	458-467
Number of pages	10
ISBN (Print)	3540314253, 9783540314257
DOIs	https://doi.org/10.1007/11618058_41
State	Published - 2006
Event	13th International Symposium on Graph Drawing, GD 2005 - Limerick, Ireland Duration: Sep 12 2005 → Sep 14 2005

Publication series

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

Conference

Conference	13th International Symposium on Graph Drawing, GD 2005
Country/Territory	Ireland
City	Limerick
Period	09/12/05 → 09/14/05

Access to Document

10.1007/11618058_41

Cite this

Zhang, H., & He, X. (2006). An application of well-orderly trees in graph drawing. In Graph Drawing - 13th International Symposium, GD 2005, Revised Papers (pp. 458-467). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3843 LNCS). Springer Verlag. https://doi.org/10.1007/11618058_41

@inproceedings{828ff0525d7444d8a0e15c0a0e3e79b9,

title = "An application of well-orderly trees in graph drawing",

abstract = "Well-orderly trees seem to have the potential of becoming a powerful technique capable of deriving new results in graph encoding, graph enumeration and graph generation [3, 4]. In this paper, we reduce the height of the visibility representation of plane graphs from 5n/6 to (4n -1)/5, by using well-orderly trees.",

author = "Huaming Zhang and Xin He",

year = "2006",

doi = "10.1007/11618058\_41",

language = "English",

isbn = "3540314253",

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

publisher = "Springer Verlag",

pages = "458--467",

booktitle = "Graph Drawing - 13th International Symposium, GD 2005, Revised Papers",

address = "Germany",

note = "13th International Symposium on Graph Drawing, GD 2005 ; Conference date: 12-09-2005 Through 14-09-2005",

}

Zhang, H & He, X 2006, An application of well-orderly trees in graph drawing. in Graph Drawing - 13th International Symposium, GD 2005, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3843 LNCS, Springer Verlag, pp. 458-467, 13th International Symposium on Graph Drawing, GD 2005, Limerick, Ireland, 09/12/05. https://doi.org/10.1007/11618058_41

An application of well-orderly trees in graph drawing. / Zhang, Huaming; He, Xin.
Graph Drawing - 13th International Symposium, GD 2005, Revised Papers. Springer Verlag, 2006. p. 458-467 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3843 LNCS).

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

TY - GEN

T1 - An application of well-orderly trees in graph drawing

AU - Zhang, Huaming

AU - He, Xin

PY - 2006

Y1 - 2006

N2 - Well-orderly trees seem to have the potential of becoming a powerful technique capable of deriving new results in graph encoding, graph enumeration and graph generation [3, 4]. In this paper, we reduce the height of the visibility representation of plane graphs from 5n/6 to (4n -1)/5, by using well-orderly trees.

AB - Well-orderly trees seem to have the potential of becoming a powerful technique capable of deriving new results in graph encoding, graph enumeration and graph generation [3, 4]. In this paper, we reduce the height of the visibility representation of plane graphs from 5n/6 to (4n -1)/5, by using well-orderly trees.

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

U2 - 10.1007/11618058_41

DO - 10.1007/11618058_41

M3 - Conference contribution

AN - SCOPUS:33745679616

SN - 3540314253

SN - 9783540314257

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

SP - 458

EP - 467

BT - Graph Drawing - 13th International Symposium, GD 2005, Revised Papers

PB - Springer Verlag

T2 - 13th International Symposium on Graph Drawing, GD 2005

Y2 - 12 September 2005 through 14 September 2005

ER -

An application of well-orderly trees in graph drawing

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this