{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:20:11Z","timestamp":1725574811269},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262084"},{"type":"electronic","value":"9783540321064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11494669_141","type":"book-chapter","created":{"date-parts":[[2011,1,13]],"date-time":"2011-01-13T14:48:09Z","timestamp":1294930089000},"page":"1149-1156","source":"Crossref","is-referenced-by-count":7,"title":["Graph Partitioning via Recurrent Multivalued Neural Networks"],"prefix":"10.1007","author":[{"given":"Enrique","family":"M\u00e9rida-Casermeiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domingo","family":"L\u00f3pez-Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"141_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0893-6080(96)00065-2","volume":"10-3","author":"A. Alberti","year":"1997","unstructured":"Alberti, A., Bertoni, A., Campadelli, P., Grossi, G., Posenato, R.: A neural algorithm for MAX-2SAT: performance analysis and circuit implementation. Neural Networks\u00a010-3, 555\u2013560 (1997)","journal-title":"Neural Networks"},{"key":"141_CR2","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F. Barahona","year":"1988","unstructured":"Barahona, F., Grotschel, M., Junger, M., Reinelt, G.: An Application of combinatorial optimization to statistical physics and circuit layout design. Operat. Research\u00a036, 493\u2013513 (1988)","journal-title":"Operat. Research"},{"key":"141_CR3","unstructured":"Bertoni, A., Campadelli, P., Grossi, G.: An approximation algorithm for the maximum cut problem and its experimental analysis. Proceedings: Algorithms and experiments. Trento\u00a09-11, 137\u2013143 (1998)"},{"key":"141_CR4","series-title":"Lecture Notes in Computer Science","first-page":"76","volume-title":"Software Engineering and Human-Computer Interaction","author":"S. Chatterjee","year":"1996","unstructured":"Chatterjee, S., Gilbert, J.R., Schreiber, R., Sheffler, T.J.: Array Distribution in Data-Parallel Programs. In: Taylor, R.N., Coutaz, J. (eds.) ICSE-WS 1994 and SE-HCI 1994. LNCS, vol.\u00a0896, pp. 76\u201391. Springer, Heidelberg (1996)"},{"key":"141_CR5","doi-asserted-by":"crossref","unstructured":"Elias, P., Feinstein, A., Shannon, C.E.: Note on Maximum Flow Through a Network. IRE Transactions on Information Theory\u00a0IT-2, 117\u2013199 (1956)","DOI":"10.1109\/TIT.1956.1056816"},{"key":"141_CR6","series-title":"A guide to the theory of NP-Completeness","volume-title":"Computers and Intractability","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 and Company, New York (1979)"},{"key":"141_CR7","first-page":"551","volume":"9","author":"R. Gomory","year":"1961","unstructured":"Gomory, R., Hu, T.C.: Multi-terminal network flows. J. SIAM\u00a09, 551\u2013570 (1961)","journal-title":"J. SIAM"},{"issue":"1","key":"141_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01585164","volume":"62","author":"E.J.L. Johnson","year":"1993","unstructured":"Johnson, E.J.L., Mehrotra, A., Nemhauser, G.L.: Min-cut clustering. Mathematical Programming\u00a062(1), 133\u2013151 (1993)","journal-title":"Mathematical Programming"},{"key":"141_CR9","doi-asserted-by":"crossref","unstructured":"Karger, D.R.: Minimum cuts in near-linear time. In: Proc. 28th Annual ACM Symposium on Theory of Computing, pp. 56\u201363 (1996)","DOI":"10.1145\/237814.237829"},{"issue":"4","key":"141_CR10","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"D.R. Karger","year":"1996","unstructured":"Karger, D.R., Stein, C.: A new approach to the minimum cut problem. J. Assoc. Comput. Mach.\u00a043(4), 601\u2013640 (1996)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"141_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing\u00a048(1), 96\u2013129 (1998)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"141_CR12","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Rodr\u00edguez, D., M\u00e9rida-Casermeiro, E.: Matrix Bandwidth Minimization: A Neural Approach. In: Proceedings of International Conference of Computational Methods in Science and Engineering, ICCMSE, vol.\u00a01, pp. 324\u2013327 (2004)","DOI":"10.1201\/9780429081385-79"},{"key":"141_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1012751230791","volume":"14","author":"E. M\u00e9rida-Casermeiro","year":"2001","unstructured":"M\u00e9rida-Casermeiro, E., Gal\u00e1n-Mar\u00edn, G., Mu\u00f1oz-P\u00e9rez, J.: An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem. Neural Processing Letters\u00a014, 203\u2013216 (2001)","journal-title":"Neural Processing Letters"},{"key":"141_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-44868-3_44","volume-title":"Computational Methods in Neural Modeling","author":"E. M\u00e9rida-Casermeiro","year":"2003","unstructured":"M\u00e9rida-Casermeiro, E., Mu\u00f1oz-P\u00e9rez, J., Ben\u00edtez-Rochel, R.: Neural Implementation of Dijkstra\u2019s Algorithm. In: Mira, J., \u00c1lvarez, J.R. (eds.) IWANN 2003. LNCS, vol.\u00a02686, pp. 342\u2013349. Springer, Heidelberg (2003)"},{"key":"141_CR15","doi-asserted-by":"crossref","unstructured":"M\u00e9rida-Casermeiro, E., L\u00f3pez-Rodr\u00edguez, D.: Multivalued Neural Network for Graph MaxCut Problem. In: Proceedings of International Conference of Computational Methods in Science and Engineering, ICCMSE, vol.\u00a01, pp. 375\u2013378 (2004)","DOI":"10.1201\/9780429081385-91"},{"key":"141_CR16","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. SIAM J. Disc. Meth.\u00a05, 54\u201366 (1992)","journal-title":"SIAM J. Disc. Meth."},{"key":"141_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF02592076","volume":"39","author":"A. Ramanathan","year":"1987","unstructured":"Ramanathan, A., Colbourn, C.: Counting Almost Minimum Cutsets with Reliability Applications. Math. Prog.\u00a039, 253\u2013261 (1987)","journal-title":"Math. Prog."},{"key":"141_CR18","doi-asserted-by":"crossref","DOI":"10.1142\/1953","volume-title":"Neural computing for optimization and combinatorics","author":"Y. Takefuyi","year":"1996","unstructured":"Takefuyi, Y., Wang, J.: Neural computing for optimization and combinatorics, vol.\u00a03. World Scientific, Singapore (1996)"},{"key":"141_CR19","unstructured":"Wang, J., Tang, Z.: An improved optimal competitive Hopfield network for bipartite subgraph problems. Neurocomputing (in press)"},{"key":"141_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/A:1008123922971","volume":"17","author":"D. Yang","year":"2000","unstructured":"Yang, D., Chung, Y., Chen, C., Liao, C.: A Dynamic Diffusion Optimization Method for Irregular Finite Element Graph Partitioning. The Journal of Supercomputing\u00a017, 91\u2013110 (2000)","journal-title":"The Journal of Supercomputing"}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Bioinspired Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11494669_141.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:59:27Z","timestamp":1605643167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11494669_141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262084","9783540321064"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11494669_141","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}