Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/2388

Title: Genetic algorithms for bipartite and outerplanar graph drawings are best!
Authors: He, Hongmei
Newton, Matthew
Sykora, Ondrej
Issue Date: 2005
Citation: HE, NEWTON and SÝKORA, 2005. Genetic algorithms for bipartite and outerplanar graph drawings are best! IN: Communications of the 31st Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2005), Liptovsky Jan, Slovakia, 22-28 January
Abstract: We design genetic algorithms with small populations for two basic problems of graph drawing: the one-sided bipartite drawing and the outerplanar drawing. We compare our results for the one-sided bipartite drawing problem with Penalty Minimisation (PM)[3], the best one-sided heuristic currently available. For graphs without a structural symmetry, our genetic algorithm achieves drawings with lower numbers of crossings than PM. If run on different initial random seeds and for a longer time, we can achieve same results as PM for graphs with a symmetrical structure. We compare performance of our genetic algorithm for the outerplanar drawing with the previously known best heuristic algorithms such as [2] and [7] on more important suites of graphs and get better results.
Description: This is a conference paper
URI: https://dspace.lboro.ac.uk/2134/2388
Appears in Collections:Conference Papers and Presentations (Computer Science)

Files associated with this item:

File Description SizeFormat
HS04.pdf232.21 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.