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

Title: Heuristic crossing minimisation algorithms for the two-page drawing problem
Authors: He, Hongmei
Sykora, Ondrej
Salagean, A.M.
Vrt'o, Imrich
Keywords: Book drawings
One-page crossing number
Hamiltonian cycle
Strategies of edge distribution
Optimal solutions
Issue Date: 22-Sep-2006
Abstract: The minimisation of edge crossings in a book drawing of a graph G is one of the important goals for a linear VLSI design, and the two-page crossing number of a graph G provides an upper bound for the standard planar crossing number. We propose several new heuristics for the two-page drawing problem, and test them on benchmark test suites, Rome graphs and Random Connected Graphs. We also test some typical graphs, and get some exact results. The results for some circulant graphs are better than the one presented by Cimikowski. We have a conjecture for cartesian graphs, supported by our experimental results, and provide direct methods to get optimal solutions for 3- or 4-row meshes and Halin graphs.
Description: This is a pre-print
URI: https://dspace.lboro.ac.uk/2134/2377
Appears in Collections:Pre-Prints (Computer Science)

Files associated with this item:

File Description SizeFormat
HSSV05.pdf359.25 kBAdobe PDFView/Open


SFX Query

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