Genetic algorithms for the 2-page book drawing problem of graphs

Authors:
Hongmei He;Ondrej Sýkora;Erkki Mäkinen
Affiliations:
Department of Computer Science, Loughborough University Loughborough, Leicestershire, The United Kingdom;Department of Computer Science, Loughborough University Loughborough, Leicestershire, The United Kingdom;Department of Computer Sciences, University of Tampere, Tampere, Finland
Venue:
Journal of Heuristics
Year:
2007

Citing 6
Cited 2

Crossing Minimization in Linear Embeddings of Graphs

IEEE Transactions on Computers
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
The book crossing number of a graph

Journal of Graph Theory
Algorithms for the fixed linear crossing number problem

Discrete Applied Mathematics
Graph Layout Using a Genetic Algorithm

SBRN '00 Proceedings of the VI Brazilian Symposium on Neural Networks (SBRN'00)
A neural-network algorithm for a graph layout problem

IEEE Transactions on Neural Networks

Parallelisation of genetic algorithms for the 2-page crossing number problem

Journal of Parallel and Distributed Computing
Approximating the fixed linear crossing number

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.