Zobrazeno 1 - 3
of 3
pro vyhledávání: '"one-page book crossing number"'
Publikováno v:
Open Computer Science, Vol 5, Iss 1, Pp 22-40 (2015)
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
Externí odkaz:
https://doaj.org/article/05f7055f975e46e9b9144ada6bc33246
Publikováno v:
Open Computer Science, Vol 5, Iss 1, Pp 22-40 (2015)
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db1a32ae4899ae77a67bd529022f58f0
https://doi.org/10.1515/comp-2015-0004
https://doi.org/10.1515/comp-2015-0004
Publikováno v:
The Electronic Journal of Combinatorics. 11
We extend a lower bound due to Shahrokhi, Sýkora, Székely and Vrťo for the outerplanar crossing number (in other terminologies also called convex, circular and one-page book crossing number) to a more general setting. In this setting we can show a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6dc1bef9cd0054edd069a4f43d3edea5
https://doi.org/10.37236/1834
https://doi.org/10.37236/1834