Regular edge labelings and drawings of planar graphs

Xin He; Ming Yang Kao

doi:10.1007/3-540-58950-3_360

Regular edge labelings and drawings of planar graphs

Xin He, Ming Yang Kao

Computer Science

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

5 Scopus citations

Abstract

The problems of nicely drawing planar graphs have received increasing attention due to their broad applications [5]. A technique, regular edge labeling, was successfully used in solving several planar graph drawing problems, including visibility representation, straight-line embedding, and rectangular dual problems. A regular edge labeling of a plane graph G labels the edges of G so that the edge labels around any vertex show certain regular pattern. The drawing of G is obtained by using the combinatorial structures resulting from the edge labeling. In this paper, we survey these drawing algorithms and discuss some open problems.

Original language	English (US)
Title of host publication	Graph Drawing - DIMACS International Workshop, GD 1994, Proceedings
Editors	Ioannis G. Tollis, Roberto Tamassia
Publisher	Springer Verlag
Pages	96-103
Number of pages	8
ISBN (Print)	3540589503, 9783540589501
DOIs	https://doi.org/10.1007/3-540-58950-3_360
State	Published - 1995
Event	DIMACS International Workshop on Graph Drawing, GD 1994 - Princeton, United States Duration: Oct 10 1994 → Oct 12 1994

Publication series

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

Other

Other	DIMACS International Workshop on Graph Drawing, GD 1994
Country/Territory	United States
City	Princeton
Period	10/10/94 → 10/12/94

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-58950-3_360

Cite this

He, X., & Kao, M. Y. (1995). Regular edge labelings and drawings of planar graphs. In I. G. Tollis, & R. Tamassia (Eds.), Graph Drawing - DIMACS International Workshop, GD 1994, Proceedings (pp. 96-103). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 894). Springer Verlag. https://doi.org/10.1007/3-540-58950-3_360

@inproceedings{a794752983f54cf7876a60a4cce70455,

title = "Regular edge labelings and drawings of planar graphs",

abstract = "The problems of nicely drawing planar graphs have received increasing attention due to their broad applications [5]. A technique, regular edge labeling, was successfully used in solving several planar graph drawing problems, including visibility representation, straight-line embedding, and rectangular dual problems. A regular edge labeling of a plane graph G labels the edges of G so that the edge labels around any vertex show certain regular pattern. The drawing of G is obtained by using the combinatorial structures resulting from the edge labeling. In this paper, we survey these drawing algorithms and discuss some open problems.",

author = "Xin He and Kao, {Ming Yang}",

year = "1995",

doi = "10.1007/3-540-58950-3_360",

language = "English (US)",

isbn = "3540589503",

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

publisher = "Springer Verlag",

pages = "96--103",

editor = "Tollis, {Ioannis G.} and Roberto Tamassia",

booktitle = "Graph Drawing - DIMACS International Workshop, GD 1994, Proceedings",

}

He, X & Kao, MY 1995, Regular edge labelings and drawings of planar graphs. in IG Tollis & R Tamassia (eds), Graph Drawing - DIMACS International Workshop, GD 1994, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 894, Springer Verlag, pp. 96-103, DIMACS International Workshop on Graph Drawing, GD 1994, Princeton, United States, 10/10/94. https://doi.org/10.1007/3-540-58950-3_360

Regular edge labelings and drawings of planar graphs. / He, Xin; Kao, Ming Yang.
Graph Drawing - DIMACS International Workshop, GD 1994, Proceedings. ed. / Ioannis G. Tollis; Roberto Tamassia. Springer Verlag, 1995. p. 96-103 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 894).

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

TY - GEN

T1 - Regular edge labelings and drawings of planar graphs

AU - He, Xin

AU - Kao, Ming Yang

PY - 1995

Y1 - 1995

N2 - The problems of nicely drawing planar graphs have received increasing attention due to their broad applications [5]. A technique, regular edge labeling, was successfully used in solving several planar graph drawing problems, including visibility representation, straight-line embedding, and rectangular dual problems. A regular edge labeling of a plane graph G labels the edges of G so that the edge labels around any vertex show certain regular pattern. The drawing of G is obtained by using the combinatorial structures resulting from the edge labeling. In this paper, we survey these drawing algorithms and discuss some open problems.

AB - The problems of nicely drawing planar graphs have received increasing attention due to their broad applications [5]. A technique, regular edge labeling, was successfully used in solving several planar graph drawing problems, including visibility representation, straight-line embedding, and rectangular dual problems. A regular edge labeling of a plane graph G labels the edges of G so that the edge labels around any vertex show certain regular pattern. The drawing of G is obtained by using the combinatorial structures resulting from the edge labeling. In this paper, we survey these drawing algorithms and discuss some open problems.

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

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

U2 - 10.1007/3-540-58950-3_360

DO - 10.1007/3-540-58950-3_360

M3 - Conference contribution

AN - SCOPUS:84957574307

SN - 3540589503

SN - 9783540589501

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

SP - 96

EP - 103

BT - Graph Drawing - DIMACS International Workshop, GD 1994, Proceedings

A2 - Tollis, Ioannis G.

A2 - Tamassia, Roberto

PB - Springer Verlag

T2 - DIMACS International Workshop on Graph Drawing, GD 1994

Y2 - 10 October 1994 through 12 October 1994

ER -

He X, Kao MY. Regular edge labelings and drawings of planar graphs. In Tollis IG, Tamassia R, editors, Graph Drawing - DIMACS International Workshop, GD 1994, Proceedings. Springer Verlag. 1995. p. 96-103. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-58950-3_360

Regular edge labelings and drawings of planar graphs

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this