A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Computing Radial Drawings on the Minimum Number of Circles
2005
Journal of Graph Algorithms and Applications
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.
doi:10.7155/jgaa.00114
fatcat:4qsqknezznehhasrj2vvmi5nwq