Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves (Extended Abstract)

Di Giacomo, Emilio and Didimo, Walter (2004) Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves (Extended Abstract). In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 419-424 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_39).

Full text not available from this repository.

Abstract

We study how to draw a 2-outerplane graph on two concentric circles, so that the internal (resp. external) vertices lie on the internal (resp. external) circle.

Item Type:Conference Paper
Additional Information:10.1007/978-3-540-24595-7_39
Classifications:P Styles > P.720 Straight-line
G Algorithms and Complexity > G.560 Geometry
ID Code:471

Repository Staff Only: item control page

References

B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. JACM, 41(1):153-180, 1994.

H. L. Bodlander. Some classes of graphs with bounded tree width. Bulletin of the European Association for Theoretical Computer Science, pages 116-126, 1988.

S. Cornelsen, T. Schank, and D. Wagner. Drawing graphs on the two and three lines. In Graph Drawing (proc. GD '02), volume 2528 of LNCS, pages 31-41, 2002.

C. M. D. Bienstock. On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica, 5(1):93-109, 1990.

E. Di Giacomo, W. Didimo, G. Liotta, and S. K. Wismath. Drawing planar graphs on a curve. In Proc. WG '03, LNCS, to appear.