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

Simple item page
dc.contributor.authorHe, Hongmei
dc.contributor.authorSălăgean, Ana
dc.contributor.authorMäkinen, Erkki
dc.contributor.authorVrt'o, Imrich
dc.date.accessioned2017-11-03T11:40:54Z
dc.date.available2017-11-03T11:40:54Z
dc.date.issued2015-08-13
dc.description.abstractWe 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.en_UK
dc.identifier.citationHe H, Salagean A, Makinen E, Vrt’o I, Various heuristic algorithms for the two-page drawing problem of graphs, Open Computer Science, Vol. 5, Issue 1, August 2015, pp. 22-40en_UK
dc.identifier.issn2299-1093
dc.identifier.urihttp://dx.doi.org/10.1515/comp-2015-0004
dc.identifier.urihttps://dspace.lib.cranfield.ac.uk/handle/1826/12700
dc.language.isoenen_UK
dc.publisherDe Gruyteren_UK
dc.rightsAttribution-Non-Commercial-No Derivatives 3.0 Unported (CC BY-NC-ND 3.0). You are free to: Share — copy and redistribute the material in any medium or format. The licensor cannot revoke these freedoms as long as you follow the license terms. Under the following terms: Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use. Information: Non-Commercial — You may not use the material for commercial purposes. No Derivatives — If you remix, transform, or build upon the material, you may not distribute the modified material. No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
dc.subjectHeuristic algorithmen_UK
dc.subjectTwo-page book crossing numberen_UK
dc.subjectOne-page book crossing numberen_UK
dc.subjectHamiltonian cycleen_UK
dc.subjectPlanar drawingen_UK
dc.titleVarious heuristic algorithms to minimise the two-page crossing numbers of graphsen_UK
dc.typeArticleen_UK

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Various_heuristic_algorithms_to_minimise_the_two-page_crossing_numbers_of_graphs-2015.pdf
Size:
1.13 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.79 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Staff publications (SATM)