Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings of planar graphs by using the minimum number of concentric circles. We assume that the edges are drawn as straight-line segments and that co-circular vertices can be adjacent. It is proven that the problem can be solved in polynomial time.
- 2.Bachmaier, C., Brandenburg, F., Forster, M.: Track planarity testing and embedding. In: Proc. SOFSEM 2004, vol. 2, pp. 3–17 (2004)Google Scholar
- 7.Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Curve-constrained drawings of planar graphs. Comp. Geometry: Theory and Appl. (to appear)Google Scholar
- 8.Dodge, M., Kitchin, R.: Atlas of Cyberspace. Addison-Wesley, Reading (2001)Google Scholar
- 9.Dorogstev, S.N., Mendes, J.F.F.: Evolution of Networks, From Biological Nets to the Internet and WWW. Oxford University Press, Oxford (2003)Google Scholar
- 10.Harary, F.: Graph Theory. Addison-Wesley, Reading (1972)Google Scholar