Computing radial drawings on the minimum number of circles.

Di Giacomo, Emilio; Didimo, Walter; Liotta, Giuseppe; Meijer, Henk

Journal of Graph Algorithms and Applications (2005)

  • Volume: 9, Issue: 3, page 365-389
  • ISSN: 1526-1719

How to cite

top

Di Giacomo, Emilio, et al. "Computing radial drawings on the minimum number of circles.." Journal of Graph Algorithms and Applications 9.3 (2005): 365-389. <http://eudml.org/doc/55403>.

@article{DiGiacomo2005,
author = {Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk},
journal = {Journal of Graph Algorithms and Applications},
keywords = {crossing-free straight-line radial drawing on circles; crossing-free straight-line radial drawing on circles},
language = {eng},
number = {3},
pages = {365-389},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Computing radial drawings on the minimum number of circles.},
url = {http://eudml.org/doc/55403},
volume = {9},
year = {2005},
}

TY - JOUR
AU - Di Giacomo, Emilio
AU - Didimo, Walter
AU - Liotta, Giuseppe
AU - Meijer, Henk
TI - Computing radial drawings on the minimum number of circles.
JO - Journal of Graph Algorithms and Applications
PY - 2005
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 9
IS - 3
SP - 365
EP - 389
LA - eng
KW - crossing-free straight-line radial drawing on circles; crossing-free straight-line radial drawing on circles
UR - http://eudml.org/doc/55403
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.