A Multilevel Algorithm for Force-Directed Graph Drawing
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A multilevel memetic algorithm for large sat-encoded problems
Evolutionary Computation
| Hi-index | 0.00 |
We describe a multi-scale approach to the problem of drawing undirected straight-line graphs ``nicely". In contrast to conventional global/dynamic algorithms, we employ increasingly coarser-scale representations of the graph, together with a simple local organization scheme, without imposing formal criteria on the quality of the picture at large. Our algorithm can deal easily with very large graphs; some of our examples contain over 1000 vertices.