Regular Edge Labelings and Drawings of Planar Graphs

He, Xin and Kao, Ming-Yang (1995) Regular Edge Labelings and Drawings of Planar Graphs. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 96-103(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_360).

Full text not available from this repository.

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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-58950-3_360
Classifications: M Methods > M.600 Planar
G Algorithms and Complexity > G.630 Labeling
A General Literature > A.001 Introductory and Survey
P Styles > P.540 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/102

Actions (login required)

View Item View Item