{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T20:40:09Z","timestamp":1740861609150,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540215233"},{"type":"electronic","value":"9783540246213"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-24621-3_8","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T17:52:26Z","timestamp":1295027546000},"page":"91-102","source":"Crossref","is-referenced-by-count":0,"title":["Optimising Graph Partitions Using Parallel Evolution"],"prefix":"10.1007","author":[{"given":"R.","family":"Ba\u00f1os","sequence":"first","affiliation":[]},{"given":"C.","family":"Gil","sequence":"additional","affiliation":[]},{"given":"J.","family":"Ortega","sequence":"additional","affiliation":[]},{"given":"F. G.","family":"Montoya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C.J. Alpert","year":"1995","unstructured":"Alpert, C.J., Kahng, A.: Recent Developments in Netlist Partitioning: A Survey. Integration: the VLSI Journal\u00a019(1-2), 1\u201381 (1995)","journal-title":"Integration: the VLSI Journal"},{"key":"8_CR2","volume-title":"Parallel Algorithms for VLSI Computer Aided Design","author":"P. Banerjee","year":"1994","unstructured":"Banerjee, P.: Parallel Algorithms for VLSI Computer Aided Design. Prentice Hall, Englewoods Cliffs (1994)"},{"issue":"5","key":"8_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/1096-9128(20000425)12:5<311::AID-CPE492>3.0.CO;2-Q","volume":"12","author":"C. Gil","year":"2000","unstructured":"Gil, C., Ortega, J., Montoya, M.G.: Parallel VLSI Test in a Shared Memory Multiprocessors. Concurrency: Practice and Experience\u00a012(5), 311\u2013326 (2000)","journal-title":"Concurrency: Practice and Experience"},{"key":"8_CR4","unstructured":"Mobasher, B., Jain, N., Han, E.H., Srivastava, J.: Web mining: Pattern discovery from world wide web transactions. Technical Report TR-96-050, Department of computer science, University of Minnesota, Minneapolis (1996)"},{"issue":"6","key":"8_CR5","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/0306-4379(96)00024-5","volume":"21","author":"S. Shekhar","year":"1996","unstructured":"Shekhar, S., DLiu, D.R.: Partitioning similarity graphs: A framework for declustering problems. Information Systems Journal\u00a021(6), 475\u2013496 (1996)","journal-title":"Information Systems Journal"},{"key":"8_CR6","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 & Company, San Francisco (1979)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Kernighan, B.W., Lin, S.: An Efficient Heuristic Procedure for Partitioning Graphics, The Bell Sys. Tech. Journal, 291\u2013307 (1970)","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Fiduccia, C., Mattheyses, R.: A Linear Time Heuristic for Improving Network Partitions. In: Proc. 19th IEEE Design Automation Conference, pp. 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"issue":"5","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1137\/S1064827593255135","volume":"18","author":"H.D. Simon","year":"1997","unstructured":"Simon, H.D., Teng, S.: How Good is Recursive Bisection? SIAM J. Scientific Computing\u00a018(5), 1436\u20131445 (1997)","journal-title":"SIAM J. Scientific Computing"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Gilbert, J., Miller, G., Teng, S.: Geometric Mesh Partitioning: Implementation and Experiments. In: Proc. 9th Int. Parallel Processing Symposium, pp. 418\u2013427 (1995)","DOI":"10.1109\/IPPS.1995.395965"},{"issue":"1","key":"8_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":"8_CR12","doi-asserted-by":"crossref","unstructured":"Cong, J., Smith, M.: A Parallel Bottom-up Clustering Algorithm with Applications to Circuit Partitioning in VLSI Design. In: Proc. ACM\/IEEE Design Automation Conference, pp. 755\u2013760 (1993)","DOI":"10.1145\/157485.165119"},{"issue":"7","key":"8_CR13","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1109\/12.508322","volume":"45","author":"T.N. Bui","year":"1996","unstructured":"Bui, T.N., Moon, B.: Genetic Algorithm and Graph Partitioning. IEEE Transactions on Computers\u00a045(7), 841\u2013855 (1996)","journal-title":"IEEE Transactions on Computers"},{"key":"8_CR14","unstructured":"Soper, A.J., Walshaw, C., Cross, M.: A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph Partitioning, Mathematics Research Report 00\/IM\/58, University of Greenwich (2000)"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1020551011615","volume":"23","author":"C. Gil","year":"2002","unstructured":"Gil, C., Ortega, J., Montoya, M.G., Ba\u00f1os, R.: A Mixed Heuristic for Circuit Partitioning. Computational Optimization and Applications Journal\u00a023(3), 321\u2013340 (2002)","journal-title":"Computational Optimization and Applications Journal"},{"key":"8_CR16","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":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Comput.\u00a020(1), 359\u2013392 (1998)","journal-title":"SIAM Journal on Scientific Comput."},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1993","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1993)","journal-title":"Science"},{"key":"8_CR19","first-page":"70","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"F. Glover","year":"1993","unstructured":"Glover, F., Laguna, M.: Tabu Search. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, pp. 70\u2013150. Blackwell, London (1993)"},{"key":"8_CR20","unstructured":"Cantu-Paz, E.: A Survey of Parallel Genetic Algorithms. Technical Report IlliGAL 97003, University of Illinois at Urbana-Champaign (1997)"},{"key":"8_CR21","unstructured":"Graph Partitioning Archive, http:\/\/www.gre.ac.uk\/c.walshaw\/partition\/ URL time: April 25 (2003), 2045"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24621-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T20:15:14Z","timestamp":1740860114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24621-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540215233","9783540246213"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24621-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}