Geodesic
Computing Radial Drawings on the Minimum Number of Circles
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the Twelfth International Symposium on Graph Drawing, GD 2004 , Tome 9 (2005) no. 3, pp. 365-389.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

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. The solution is based on a characterization of those graphs that admit a crossing-free straight-line radial drawing on k circles. For the graphs in this family, a linear time algorithm that computes a radial drawing on k circles is also presented. 
@article{JGAA_2005_9_3_a4,
     author = {Emilio Di Giacomo and Walter Didimo and Giuseppe Liotta and Henk Meijer},
     title = {Computing {Radial} {Drawings} on the {Minimum} {Number} of {Circles}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {365--389},
     publisher = {mathdoc},
     volume = {9},
     number = {3},
     year = {2005},
     doi = {10.7155/jgaa.00114},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00114/}
}
TY  - JOUR
AU  - Emilio Di Giacomo
AU  - Walter Didimo
AU  - Giuseppe Liotta
AU  - Henk Meijer
TI  - Computing Radial Drawings on the Minimum Number of Circles
JO  - Journal of Graph Algorithms and Applications
PY  - 2005
SP  - 365
EP  - 389
VL  - 9
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00114/
DO  - 10.7155/jgaa.00114
LA  - en
ID  - JGAA_2005_9_3_a4
ER  - 
%0 Journal Article
%A Emilio Di Giacomo
%A Walter Didimo
%A Giuseppe Liotta
%A Henk Meijer
%T Computing Radial Drawings on the Minimum Number of Circles
%J Journal of Graph Algorithms and Applications
%D 2005
%P 365-389
%V 9
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00114/
%R 10.7155/jgaa.00114
%G en
%F JGAA_2005_9_3_a4
Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer. Computing Radial Drawings on the Minimum Number of Circles. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the Twelfth International Symposium on Graph Drawing, GD 2004
					, Tome 9 (2005) no. 3, pp. 365-389. doi : 10.7155/jgaa.00114. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00114/

Cité par Sources :