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/2383

Title: Genetic algorithms for the 2-page book drawing problem of graphs
Authors: He, H.
Sykora, Ondrej
Makinen, E.
Keywords: Genetic algorithms
2-page crossing number
Hamiltonian cycle
Order of vertices
Edge distribution
Optimal values
Issue Date: 2007
Publisher: © Springer
Citation: HE, H., SÝKORA, O. and MÄKINEN, E., 2007. Genetic algorithms for the 2-page book drawing problem of graphs. Journal of Heuristics, 13 (1), pp. 77-93
Abstract: The minimisation of edge crossings in a book drawing of a graph is one of the important goals for a linear VLSI design, and the 2-page crossing number of a graph provides an upper bound for the standard planar crossing number. We design genetic algorithms for the 2-page drawings, and test them on the benchmark test suits, Rome graphs and Random Connected Graphs. We also test some circulant graphs, and get better results than previously presented in the literature. Moreover, we formalise three conjectures for certain kinds of circulant graphs, supported by our experimental results.
Description: This article will be published in the Journal of Heuristics [© Springer] and will also available at: http://www.springerlink.com/content/1572-9397/
Version: Accepted for publication
DOI: 10.1007/s10732-006-9000-4
URI: https://dspace.lboro.ac.uk/2134/2383
ISSN: 1381-1231
1572-9397
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
HSM06a.pdf6.57 MBAdobe PDFView/Open

 

SFX Query

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