Dynamic graph drawing with a hybridized genetic algorithm

Abstract : Automatic graph drawing algorithms, especially those for hierarchical digraphs, have an important place in computer-aided design software or more generally in software programs where an efficient visualization tool for complex structure is required. In these cases, aesthetics plays a major role for generating readable and understandable layouts. Besides, in an interactive approach, the program must preserve the mental map of the user between time t-1 and t. In this paper we introduce a dynamic drawing procedure for hierarchical digraph drawing. It tends to minimize arc-crossing thanks to a hybridized genetic algorithm. The hybridization consists of a local optimization step based on averaging heuristics and two problem-based crossover operators. A stability constraint based on a similarity measure is used to preserve the likeness between the layouts at time t-1 and t. Computational experiments have been done with an adapted random graph generator to simulate the construction process of 90 graphs. They confirm that, because of the actual algorithm, the arc crossing number of the selected layout is close to the best layout found. We show that computation of the similarity measure tends to preserve the likeness between the two layouts.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

Contributor : Bruno Pinaud <>
Submitted on : Friday, October 31, 2008 - 11:46:30 AM
Last modification on : Thursday, April 5, 2018 - 10:36:25 AM
Long-term archiving on : Monday, June 7, 2010 - 10:32:05 PM


Files produced by the author(s)




Bruno Pinaud, Pascale Kuntz, Rémi Lehn. Dynamic graph drawing with a hybridized genetic algorithm. Adaptive Computing in Design and Manufacture VI, 2004, Bristol, United Kingdom. pp.365-375, ⟨10.1007/978-0-85729-338-1_31⟩. ⟨inria-00335944⟩



Record views


Files downloads