{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:54:26Z","timestamp":1760597666950},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We propose several new heuristics for the twopage\nbook crossing problem, which are based on recent\nalgorithms for the corresponding one-page problem. Especially,\nthe neural network model for edge allocation is\ncombined for the first time with various one-page algorithms.\nWe investigate the performance of the new heuristics\nby testing them on various benchmark test suites. It\nis found out that the new heuristics outperform the previously\nknown heuristics and produce good approximations\nof the planar crossing number for severalwell-known\ngraph families. We conjecture that the optimal two-page\ndrawing of a graph represents the planar drawing of the\ngraph.<\/jats:p>","DOI":"10.1515\/comp-2015-0004","type":"journal-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T18:03:58Z","timestamp":1440439438000},"page":"22-40","source":"Crossref","is-referenced-by-count":2,"title":["Various heuristic algorithms to minimise the two-page crossing\nnumbers of graphs"],"prefix":"10.1515","volume":"5","author":[{"given":"Hongmei","family":"He","sequence":"first","affiliation":[{"name":"Cranfield University , Manufacturing Informatics Centre , Cranfield , MK43 0AL, UK"}]},{"given":"Ana","family":"S\u0103l\u0103gean","sequence":"additional","affiliation":[{"name":"Loughborough University , Department of Computer Science , Loughborough , LE11 3TU, UK"}]},{"given":"Erkki","family":"M\u00e4kinen","sequence":"additional","affiliation":[{"name":"Third institution, School of Information Sciences , University of Tampere , Tampere , FIN-33014 , Finland"}]},{"given":"Imrich","family":"Vrt\u2019o","sequence":"additional","affiliation":[{"name":"Slovak Academy of Sciences, Department of Informatics, Institute of Mathematics , Bratislava , Slovak Republic"}]}],"member":"374","published-online":{"date-parts":[[2015,8,13]]},"container-title":["Open Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/comp\/5\/1\/article-p22.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2015-0004\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2015-0004\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T10:47:41Z","timestamp":1717584461000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2015-0004\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,1]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2015,12,31]]},"published-print":{"date-parts":[[2015,1,1]]}},"alternative-id":["10.1515\/comp-2015-0004"],"URL":"https:\/\/doi.org\/10.1515\/comp-2015-0004","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,1]]}}}