105
click to vote
GD
2009
Springer
15 years 6 months ago
2009
Springer
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to concentric circles centered at the origin. Such constraints are typical, e.g., i...