{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:04:09Z","timestamp":1725552249462},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540335849"},{"type":"electronic","value":"9783540335856"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11739685_83","type":"book-chapter","created":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T09:55:01Z","timestamp":1146736501000},"page":"797-803","source":"Crossref","is-referenced-by-count":1,"title":["Solving the Minimum Crossing Number Problem Using an Improved Artificial Neural Network"],"prefix":"10.1007","author":[{"given":"Rong Long","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kozo","family":"Okazaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"83_CR1","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Alg. Disc. Meth.\u00a04, 312\u2013316 (1983)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"83_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01744433","volume":"17","author":"F.T. Leighton","year":"1984","unstructured":"Leighton, F.T.: New lower bound techniques for VLSI. Math. Sys. Theory\u00a017, 47\u201370 (1984)","journal-title":"Math. Sys. Theory"},{"key":"83_CR3","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/(SICI)1097-0118(199604)21:4<413::AID-JGT7>3.0.CO;2-S","volume":"21","author":"F. Shahrokhi","year":"1996","unstructured":"Shahrokhi, F., Szekely, L.A., Sykora, O., Vrto, I.: The book crossing number of a graph. J. Graph Theory\u00a021, 413\u2013424 (1996)","journal-title":"J. Graph Theory"},{"key":"83_CR4","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1126\/science.3755256","volume":"233","author":"J.J. Hopfield","year":"1986","unstructured":"Hopfield, J.J., Tank, D.W.: Computing with neural circuits: A model. Science\u00a0233, 625\u2013633 (1986)","journal-title":"Science"},{"key":"83_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1109\/72.485670","volume":"7","author":"R. Cimikowski","year":"1996","unstructured":"Cimikowski, R., Shope, P.: A neural network algorithm for a graph layout problem. IEEE Trans. on Neural Network\u00a07, 341\u2013345 (1996)","journal-title":"IEEE Trans. on Neural Network"},{"key":"83_CR6","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1109\/31.101328","volume":"38","author":"Y. Takefuji","year":"1991","unstructured":"Takefuji, Y., Lee, K.C.: Artificial neural networks for four-coloring map problems and K-colorability problems. IEEE Trans. Circuits Syst.\u00a038, 326\u2013333 (1991)","journal-title":"IEEE Trans. Circuits Syst."}],"container-title":["Lecture Notes in Computer Science","Advances in Machine Learning and Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11739685_83.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:55:50Z","timestamp":1619506550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11739685_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540335849","9783540335856"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11739685_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}