{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:01:29Z","timestamp":1725552089055},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332374"},{"type":"electronic","value":"9783540332381"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11732242_25","type":"book-chapter","created":{"date-parts":[[2006,3,3]],"date-time":"2006-03-03T15:12:37Z","timestamp":1141398757000},"page":"279-285","source":"Crossref","is-referenced-by-count":7,"title":["A Multiagent Algorithm for Graph Partitioning"],"prefix":"10.1007","author":[{"given":"Francesc","family":"Comellas","sequence":"first","affiliation":[]},{"given":"Emili","family":"Sapena","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-36605-9_14","volume-title":"Applications of Evolutionary Computing","author":"R. Ba\u00f1os","year":"2003","unstructured":"Ba\u00f1os, R., Gil, C., Ortega, J., Montoya, F.G.: Multilevel heuristic algorithm for graph partitioning. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB\/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol.\u00a02611, pp. 143\u2013153. Springer, Heidelberg (2003)"},{"issue":"5","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1558","DOI":"10.1109\/25.892539","volume":"49","author":"J. Abril","year":"2000","unstructured":"Abril, J., Comellas, F., Cort\u00e9s, A., Oz\u00f3n, J., Vaquer, M.: A multi-agent system for frequency assignment in cellular radio networks. IEEE Trans. Vehic. Tech.\u00a049(5), 1558\u20131565 (2000)","journal-title":"IEEE Trans. Vehic. Tech."},{"key":"25_CR3","first-page":"49","volume-title":"Proc. Applications of Neural Networks to Telecommunications 2","author":"F. Comellas","year":"1995","unstructured":"Comellas, F., Oz\u00f3n, J.: Graph coloring algorithms for assignment problems in radio networks. In: Alspector, J., Goodman, R., Brown, T.X. (eds.) Proc. Applications of Neural Networks to Telecommunications 2, pp. 49\u201356. Lawrence Erlbaum Ass. Inc. Publis, Hillsdale (1995)"},{"key":"25_CR4","unstructured":"The Second DIMACS Implementation Challenge: 1992-1993: NP Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability. Organized by M. Trick, \n                    \n                      http:\/\/dimacs.rutgers.edu\/Challenges\/index.html\n                    \n                    \n                  , (accessed January 8, 2006)"},{"key":"25_CR5","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) ISBN 0-7167-10447"},{"key":"25_CR6","first-page":"444","volume-title":"Proc. 29th Ann. IEEE Symp. on Foundations of Comput. Sci.","author":"O. Goldschmidt","year":"1988","unstructured":"Goldschmidt, O., Hochbaum, D.S.: Polynomial algorithm for the k-cut problem. In: Proc. 29th Ann. IEEE Symp. on Foundations of Comput. Sci., pp. 444\u2013451. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"25_CR7","volume-title":"Proc. Supercomputing 1995","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Karin, S. (ed.) Proc. Supercomputing 1995. ACM Press, New York (1995)"},{"issue":"5-6","key":"25_CR8","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1016\/j.parco.2003.12.016","volume":"30","author":"P. Koro\u0161ec","year":"2004","unstructured":"Koro\u0161ec, P., \u0160ilc, J., Robi\u010d, B.: Solving the mesh-partitioning problem with an antcolony algorithm. Parallel Computing\u00a030(5-6), 785\u2013801 (2004)","journal-title":"Parallel Computing"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1109\/SFCS.1991.185443","volume-title":"Proc. 32nd Ann. IEEE Symp. on Foundations of Comput. Sci.","author":"H. Saran","year":"1991","unstructured":"Saran, H., Vazirani, V.: Finding k-cuts within twice the optimal. In: Proc. 32nd Ann. IEEE Symp. on Foundations of Comput. Sci., pp. 743\u2013751. IEEE Computer Society, Los Alamitos (1991)"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/B:JOGO.0000042115.44455.f3","volume":"29","author":"A.J. Soper","year":"2004","unstructured":"Soper, A.J., Walshaw, C., Cross, M.: A combined evolutionary search and multilevel optimisation approach to graph partitioning. J. Global Optimization\u00a029(2), 225\u2013241 (2004)","journal-title":"J. Global Optimization"},{"key":"25_CR11","unstructured":"Trick, M.: Graph coloring instances (web page), \n                    \n                      http:\/\/mat.gsia.cmu.edu\/COLOR\/instances.html\n                    \n                    \n                  , (accessed January 8, 2006)"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1023\/B:ANOR.0000039525.80601.15","volume":"131","author":"C. Walshaw","year":"2004","unstructured":"Walshaw, C.: Multilevel refinement for combinatorial optimisation problems. Annals Oper. Res.\u00a0131, 325\u2013372 (2004)","journal-title":"Annals Oper. Res."},{"key":"25_CR13","unstructured":"Walshaw, C.: The graph partioning archive (web page), \n                    \n                      http:\/\/staffweb.cms.gre.ac.uk\/~c.walshaw\/partition\/\n                    \n                    \n                  , (accessed January 8, 2006)"},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/S1064827598337373","volume":"22","author":"C. Walshaw","year":"2000","unstructured":"Walshaw, C., Cross, M.: Mesh Partitioning: a Multilevel Balancing and Refinement Algorithm. SIAM J. Sci. Comput.\u00a022(1), 63\u201380 (2000)","journal-title":"SIAM J. Sci. Comput."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11732242_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:22:23Z","timestamp":1558290143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11732242_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332374","9783540332381"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11732242_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}