A framework and algorithms for circular drawings of graphs
From MaRDI portal
Publication:2465996
DOI10.1016/j.jda.2005.01.009zbMath1128.68078OpenAlexW2031944610MaRDI QIDQ2465996
Janet M. Six, Ioannis. G. Tollis
Publication date: 11 January 2008
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2005.01.009
graph drawinginformation visualizationnetwork visualizationexperimental studiescircular graph drawingclustered viewsminimization of crossings
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Untangling circular drawings: algorithms and complexity ⋮ Experimental Evaluation of Book Drawing Algorithms ⋮ Visual Analysis of One-to-Many Matched Graphs
Cites Work