Experiments with genetic algorithms for displaying graphs

The paper first outlines a set of propositions on displaying graphs of labeled and weighted nodes and arcs. These graphs have neither a natural spatial mapping, nor special structure. After looking at centering and local modification techniques, the core of the paper discusses the use of genetic algorithms: the combination of imperfect layouts by simulating natural selection processes. Finally, further display methods are proposed: a rule-based approach, rendering on a globe and tessellation.<
>