{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T18:44:46Z","timestamp":1725648286312},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245527"},{"type":"electronic","value":"9783642245534"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-24553-4_10","type":"book-chapter","created":{"date-parts":[[2012,1,3]],"date-time":"2012-01-03T04:49:00Z","timestamp":1325566140000},"page":"64-70","source":"Crossref","is-referenced-by-count":1,"title":["A Saturation Binary Neural Network for Bipartite Subgraph Problem"],"prefix":"10.1007","author":[{"given":"Cui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Qing","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong-Long","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problem. Theor. Comput. Sci., 237\u2013267 (1976)","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013104. Plenum, New York (1972)"},{"key":"10_CR3","unstructured":"Even, S., Shiloach, Y.: NP-completeness of several arrangement problems. Technical Report 43, Department of computer Science, Technion, Haifa Israel (1975)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Locke, S.C.: Largest bipartite subgraph in triangle-free graphs with maximum degree three. J. Graph Theory, 477\u2013504 (1986)","DOI":"10.1002\/jgt.3190100407"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Grotscheland, M., Pulleyblank, W.R.: Weakly bipartite graphs and the max-cut problem. Oper. Res. Lett., 23\u201327 (1981)","DOI":"10.1016\/0167-6377(81)90020-1"},{"issue":"5","key":"10_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0167-6377(83)90031-7","volume":"2","author":"F. Barahona","year":"1983","unstructured":"Barahona, F.: On some weakly bipartite graph. Oper. Res. Lett.\u00a02(5), 239\u2013242 (1983)","journal-title":"Oper. Res. Lett."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"J.J. Hopfield","year":"1982","unstructured":"Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proc. Nat. Acad. Sci. U.S.\u00a079, 2554\u20132558 (1982)","journal-title":"Proc. Nat. Acad. Sci. U.S."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"3088","DOI":"10.1073\/pnas.81.10.3088","volume":"81","author":"J.J. Hopfield","year":"1982","unstructured":"Hopfield, J.J.: Neurons with graded response have collective computation properties like those of two-state neurons. Proc. Nat. Acad. Sci. U.S.\u00a081, 3088\u20133092 (1982)","journal-title":"Proc. Nat. Acad. Sci. U.S."},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"J.J. Hopfield","year":"1985","unstructured":"Hopfield, J.J., Tank, D.W.: \u2019Neural\u2019 computation of decisions in optimization problems. Bio. Cybern.\u00a052, 141\u2013152 (1985)","journal-title":"Bio. Cybern."},{"issue":"5","key":"10_CR10","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TCS.1986.1085953","volume":"33","author":"J.J. Hopfield","year":"1986","unstructured":"Hopfield, J.J., Tank, D.W.: Simple \u2019Neural\u2019 optimization networks: An a\/d converter, signal decision circuit, and a linear programming circuit. IEEE Trans. Circuits Syst.\u00a033(5), 533\u2013541 (1986)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"10_CR11","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"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/72.105427","volume":"3","author":"K.C. Lee","year":"1992","unstructured":"Lee, K.C., Funabiki, N., Takefuji, Y.: A parallel improvement algorithm for the bipartite subgraph problem. IEEE Trans. Neural Networks\u00a03(1), 139\u2013145 (1992)","journal-title":"IEEE Trans. Neural Networks"},{"key":"10_CR13","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. W.H. Freeman, New York (1979)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1207\/s15516709cog0901_7","volume":"9","author":"D.H. Ackley","year":"1985","unstructured":"Ackley, D.H., Hinton, G.E., Sejnowski, T.J.: A learning algorithm for Boltzman Machines. Cognitive Science\u00a09, 147\u2013169 (1985)","journal-title":"Cognitive Science"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF02478259","volume":"5","author":"W.S. McCulloch","year":"1943","unstructured":"McCulloch, W.S., Pitts, W.H.: A logical calculus of ideas immanent in nervous activity. Bull. Math. Biophys\u00a05, 115\u2013133 (1943)","journal-title":"Bull. Math. Biophys"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF00224701","volume":"64","author":"Y. Takefuji","year":"1991","unstructured":"Takefuji, Y., Lee, K.C.: An artificial hysteresis binary neuron: A model suppressing the oscillatory behaviors of neural dynamics. Biol. Cybern.\u00a064, 353\u2013356 (1991)","journal-title":"Biol. Cybern."},{"issue":"6","key":"10_CR17","doi-asserted-by":"publisher","first-page":"1458","DOI":"10.1109\/TNN.2004.836234","volume":"15","author":"R.L. Wang","year":"2004","unstructured":"Wang, R.L., Tang, Z., Cao, Q.P.: A Hopfield Network Learning Method for Bipartite Subgraph Problem. IEEE Trans. Neural Networks\u00a015(6), 1458\u20131465 (2004)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"6","key":"10_CR18","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: An experimental evaluation; Part 1, graph partitioning. Operations Research\u00a037(6), 865\u2013892 (1989)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Bio-Inspired Computing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24553-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T15:46:18Z","timestamp":1686584778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24553-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642245527","9783642245534"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24553-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}