{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:19:33Z","timestamp":1774592373208,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540541486","type":"print"},{"value":"9783540706526","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bfb0029748","type":"book-chapter","created":{"date-parts":[[2006,1,12]],"date-time":"2006-01-12T11:53:26Z","timestamp":1137066806000},"page":"165-169","source":"Crossref","is-referenced-by-count":14,"title":["Partitioning a graph with a parallel genetic algorithm"],"prefix":"10.1007","author":[{"given":"Gregor","family":"von Laszewski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heinz","family":"M\u00fchlenbein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1002\/nme.1620140606","volume":"14","author":"G.C. Everstine","year":"1979","unstructured":"G.C. Everstine. A comparison of three resequencing algorithms for the reduction of matrix profile and wavefront. Int. J. Numer. Methods in Eng., Vol. 14, 837\u2013853, 1979.","journal-title":"Int. J. Numer. Methods in Eng."},{"key":"25_CR2","unstructured":"M. Gorges-Schleuter. ASPARAGOS: An Asynchronous Parallel Genetic Optimization Strategy. In 3rd Int. Conf. on Genetic Algorithms, San Mateo, Morgan Kaufmann, 89."},{"key":"25_CR3","unstructured":"J. R. Gilbert and E. Zmijewski. A Parallel Graph Partitioning Algorithm for a Message-Passing Multiprocessor. Techn. Report 87-803, Cornell University, 87."},{"key":"25_CR4","unstructured":"J. H. Holland. Adaptation in natural and artificial systems. Ann Arbor, University of Michigan Press, 75."},{"key":"25_CR5","unstructured":"B. W. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. Technical report, Bell Syst. Techn. J., February 70."},{"key":"25_CR6","unstructured":"G. von Laszewski. Ein paralleler genetischer Algorithmus f\u00fcr das GPP. Master's thesis, Universit\u00e4t Bonn, 90."},{"key":"25_CR7","unstructured":"G. von Laszewski. A parallel genetic algorithm for the graph partitioning problem. In Transputer Research and Aplications 4, Proc. of the 4th Conf. of the North-American Transputers Users Group, IOS Press, Ithaca, NY, 90."},{"key":"25_CR8","series-title":"Technical Report","volume-title":"A Round-Robin Parallel Partitioning Algorithm","author":"D. Moore","year":"1988","unstructured":"D. Moore. A Round-Robin Parallel Partitioning Algorithm. Technical Report 88-916, Cornell University, Ithaca, NY, 1988."},{"key":"25_CR9","unstructured":"H. M\u00fchlenbein. Parallel Genetic Algorithm, Population Dynamics and Combinatorial Optimization. In 3rd Int. Conf. on Genetic Algorithms, San Mateo, Morgan Kaufmann, 89."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029748","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T04:21:29Z","timestamp":1549426889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029748"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540541486","9783540706526"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0029748","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}