{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,8]],"date-time":"2023-10-08T10:52:15Z","timestamp":1696762335105},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T00:00:00Z","timestamp":1219795200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Ser. F-Inf. Sci."],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s11432-008-0134-x","type":"journal-article","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T04:32:20Z","timestamp":1219811540000},"page":"1947-1957","source":"Crossref","is-referenced-by-count":4,"title":["A new neural network algorithm for planarization problems"],"prefix":"10.1007","volume":"51","author":[{"given":"JunYing","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Qiang","family":"Qin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,8,27]]},"reference":[{"issue":"3","key":"134_CR1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/43.21845","volume":"8","author":"R. Jayakumar","year":"1989","unstructured":"Jayakumar R, Thulasiraman K, Swamy M N S. O(n 2) algorithms for graph planarization. IEEE Trans Comp Aid Des Integr Circ Syst, 1989, 8(3): 257\u2013267","journal-title":"IEEE Trans Comp Aid Des Integr Circ Syst"},{"key":"134_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979"},{"issue":"6","key":"134_CR3","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1137\/0222068","volume":"22","author":"J. Cai","year":"1993","unstructured":"Cai J, Hans X, Tarjan R E. An O(m log n)-time algorithm for the maximal planar subgraph problem. SIAM J Comp, 1993, 22(6): 1142\u20131162","journal-title":"SIAM J Comp"},{"issue":"15","key":"134_CR4","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1126\/science.245.4923.1221","volume":"245","author":"Y. Takefuji","year":"1989","unstructured":"Takefuji Y, Lee K-C. A near-optimum parallel planarization algorithm. Science, 1989, 245(15): 1221\u20131223","journal-title":"Science"},{"key":"134_CR5","first-page":"113","volume":"5","author":"L. A. Gladkov","year":"2004","unstructured":"Gladkov L A, Kurejchik V M. A genetic algorithm for planarization of graphs (in Russian). Izv Akad Nauk, 2004, 5: 113\u2013126","journal-title":"Izv Akad Nauk"},{"key":"134_CR6","doi-asserted-by":"crossref","first-page":"1507","DOI":"10.1093\/ietfec\/e89-a.5.1507","volume":"E89-A5","author":"R.-L. Wang","year":"2006","unstructured":"Wang R-L, Okazaki K. Solving the graph planarization problem using an improved genetic algorithm. IEICE Trans Fund Electr Commun Comput Sci, 2006, E89-A(5): 1507\u20131512","journal-title":"IEICE Trans Fund Electr Commun Comput Sci"},{"key":"134_CR7","series-title":"Lect Notes in Comput Sci","first-page":"1","volume-title":"Graph Drawing. 9th International Symposium, GD 2001. Revised Papers","author":"V. Dujmovi\u0107","year":"2002","unstructured":"Dujmovi\u0107 V, Fellows M, Hallett M, et al. A fixed-parameter approach to two-layer planarization. In: Graph Drawing. 9th International Symposium, GD 2001. Revised Papers. Lect Notes in Comput Sci, Vol 2265. Berlin: Springer-Verlag, 2002. 1\u20134"},{"issue":"3","key":"134_CR8","first-page":"278","volume":"32","author":"S. X. Lu","year":"2005","unstructured":"Lu S X. Dynamic elimination method for solving TSP by Hopfield network (in Chinese). J Zhejiang Univ, 2005, 32(3): 278\u2013291","journal-title":"J Zhejiang Univ"},{"issue":"1","key":"134_CR9","first-page":"90","volume":"35","author":"D. X. Xu","year":"2006","unstructured":"Xu D X, Qian F C. Optimal control of discrete bilinear system based on the Hopfield neural network (in Chinese). Inf Contr, 2006, 35(1): 90\u201392","journal-title":"Inf Contr"},{"issue":"2","key":"134_CR10","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1109\/72.485670","volume":"7","author":"A. Cimikowski","year":"1996","unstructured":"Cimikowski A, Shope P. A neural-network algorithm for a graph layout problem. IEEE Trans Neural Netw, 1996, 7(2): 341\u2013345","journal-title":"IEEE Trans Neural Netw"},{"issue":"2","key":"134_CR11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1023\/B:JOGO.0000015313.93974.b0","volume":"28","author":"K. F. C. Yiu","year":"2004","unstructured":"Yiu K F C, Liu Y, Teo K L. A hybrid descent method for global optimization. J Global Optim, 2004, 28(2): 229\u2013238","journal-title":"J Global Optim"}],"container-title":["Science in China Series F: Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-008-0134-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-008-0134-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-008-0134-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:35:56Z","timestamp":1559403356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-008-0134-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,27]]},"references-count":11,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["134"],"URL":"https:\/\/doi.org\/10.1007\/s11432-008-0134-x","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"value":"1009-2757","type":"print"},{"value":"1862-2836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,27]]}}}