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

Title: Crossing minimisation Heuristics for 2-page drawings
Authors: He, H.
Sykora, Ondrej
Vrt'o, Imrich
Keywords: 1-page crossing number
2-page crossing number
2-page drawing
book crossing number
Hamiltonian cycle
Issue Date: 2005
Publisher: © Elsevier
Citation: HE, SÝKORA and VRT'O, 2005. Crossing minimisation heuristics for 2-page drawings. Electronic notes in discrete mathematics, 22, pp. 527-534
Abstract: The minimisation of edge crossings in a book drawing of a graph G is one of 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 2-page drawing problem and test them on benchmark test sets like Rome graphs, Random Connected Graphs and some typical graphs. We get exact results of some structural graphs, and compare some of the experimental results with the one in paper.
Description: This article was published in the journal, Electronic notes in discrete mathematics [© Elsevier] and is also available at: http://www.sciencedirect.com/science/journal/15710653
URI: https://dspace.lboro.ac.uk/2134/2380
ISSN: 1571-0653
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
HSV05.pdf173.1 kBAdobe PDFView/Open

 

SFX Query

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