Computing Radial Drawings on the Minimum Number of Circles

DOI10.7155/jgaa.00114zbMath1161.68654OpenAlexW2162057788WikidataQ62042599 ScholiaQ62042599MaRDI QIDQ5301377

Giuseppe Liotta, Walter Didimo, Emilio Di Giacomo, Henk G. Meijer

Publication date: 19 January 2009

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/55403

zbMATH Keywords

crossing-free straight-line radial drawing on \(k\) circles

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Planar drawings with few slopes of Halin graphs and nested pseudotrees, A force-directed algorithm for drawing directed graphs symmetrically, Radial drawings of graphs: geometric constraints and trade-offs, Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time