GD
2000
Springer
15 years 16 days ago
2000
Springer
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...