Various heuristic algorithms to minimise the two-page crossing numbers of graphs release_gmxkbqolvrhkrljq3xpjly435i

by Hongmei He, Ana Sălăgean, Erkki Mäkinen, Imrich Vrt'o

Published in Open Computer Science by Walter de Gruyter GmbH.

2015  

Abstract

<jats:title>Abstract</jats:title>We propose several new heuristics for the twopage book crossing problem, which are based on recent algorithms for the corresponding one-page problem. Especially, the neural network model for edge allocation is combined for the first time with various one-page algorithms. We investigate the performance of the new heuristics by testing them on various benchmark test suites. It is found out that the new heuristics outperform the previously known heuristics and produce good approximations of the planar crossing number for severalwell-known graph families. We conjecture that the optimal two-page drawing of a graph represents the planar drawing of the graph.
In application/xml+jats format

Archived Files and Locations

application/pdf  1.2 MB
file_a2ua3icfmzhg3cja7znxyzlsvy
www.degruyter.com (publisher)
web.archive.org (webarchive)
application/pdf  1.2 MB
file_idrtrxn7mfhbzjijcqwfbq2f2m
dspace.lib.cranfield.ac.uk (web)
web.archive.org (webarchive)
application/pdf  1.1 MB
file_gobeb52rorcudcouxz6hmcwl5q
www.degruyter.com (publisher)
web.archive.org (webarchive)
application/pdf  1.2 MB
file_neb27cfu65cpjmemfjbcyqie5a
www.degruyter.com (publisher)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2015-01-13
Container Metadata
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:  2299-1093
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: f99b3b07-bf49-4757-938b-87a5fa7d2904
API URL: JSON