{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T08:10:14Z","timestamp":1736669414475,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540658214"},{"type":"electronic","value":"9783540489337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/bfb0100593","type":"book-chapter","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T18:11:30Z","timestamp":1165515090000},"page":"319-328","source":"Crossref","is-referenced-by-count":6,"title":["Lattice gas: An efficient and reusable parallel library based on a graph partitioning technique"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Dupuis","sequence":"first","affiliation":[]},{"given":"Bastien","family":"Chopard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,11,17]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"D. Rothman and S. Zaleski. Lattice-Gas Cellular Automata: Simple Models of Complex Hydrodynamics. Collection Al\u00e9a. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511524714"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"B. Chopard and M. Droz. Cellular Automata Modeling of Physical Systems. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9780511549755"},{"key":"34_CR3","unstructured":"Pascal O. Luthi. Lattice Wave Automata. PhD thesis, University of Geneva, 1998."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Fr\u00e9d\u00e9ric Guidec, Patrice Cal\u00e9gari, and Pierre Kuonen. Parallel irregular software for wave propagation simulation. In HPCN'97 High-Parallel Computing and Networking, Lecture Notes in Computer Science, pages 84\u201394 Springer-Verlag, 1997.","DOI":"10.1007\/BFb0031582"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-61142-8_591","volume-title":"HPCN'96 High-Performance Computing and Networking","author":"S. Gregorio Di","year":"1996","unstructured":"S. Di Gregorio, R. Ringo, W. Spataro, Giandomenico Spezzano, and Domenico Talia. A parellel cellular environment for high performance scientific computing. In H. Liddell at al., editor, HPCN'96 High-Performance Computing and Networking, pages 514\u2013521, Berlin, 1996. Springer-Verlag."},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. Garey","year":"1976","unstructured":"M. Garey, D. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoritical Computer Science, 1:237\u2013267, 1976.","journal-title":"Theoritical Computer Science"},{"issue":"1","key":"34_CR7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. W. Kernighan","year":"1970","unstructured":"B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell system technical journal, 49(1):291\u2013307, 1970.","journal-title":"The Bell system technical journal"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Roberto Battiti, Alan Bertossi, and R. Rizzi. Randomized greedy algorithms for the hypergraph partitioning problem. In DIMACS Workshop on Randomization Methods in Algorithm Design, October 1997.","DOI":"10.1090\/dimacs\/043\/02"},{"key":"34_CR9","unstructured":"Roberto Battiti and Alan Bertossi. Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Transactions on Computers, to appear."},{"key":"34_CR10","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1287\/opre.42.4.677","volume":"42","author":"M. Laguna","year":"1994","unstructured":"M. Laguna, T. A. feo, and H.C. Elrod. A greedy randomized adaptative search procedure for the two-partition problem. Operations Research, 42:667\u2013687, 1994.","journal-title":"Operations Research"},{"issue":"7","key":"34_CR11","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1109\/12.508322","volume":"45","author":"T. N. Bui","year":"1996","unstructured":"Thang Nguyen Bui and Byung Ro Moon. Genetic algorithm and graph partitioning. IEEE Transactions on Computers, 45(7):841\u2013855, July 1996.","journal-title":"IEEE Transactions on Computers"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Gregor von Laszewski and Heinz M\u00fchlenbein. Partitioning a graph with a parallel genetic algorithm. In Parallel problem solving from nature, pages 165\u2013169, 1991.","DOI":"10.1007\/BFb0029748"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation, Operations Research, 37:865\u2013892, 1989.","journal-title":"Operations Research"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Alex Pothen, H.D. Simon, Lien Wang, and Stephen T. Bernard. Towards a fast implementation of spectral nested dissection. In Supercomputing '92, pages 42\u201351, 1992.","DOI":"10.1109\/SUPERC.1992.236711"},{"key":"34_CR15","unstructured":"George Karypis and Vipin Kumar. A fast and highly quality multilevel scheme for partitioning irregular graphs. Technical Report 95\u2013035, Departement of Computer Science, University of Minnesota, 1995."},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Robert Leland and Bruce Hendrickson. An, empirical study of static load balancing algorithms. In Scalable High-Performance Computing Conference (SHPCC'94), pages 682\u2013685, 1994.","DOI":"10.1109\/SHPCC.1994.296707"},{"key":"34_CR17","unstructured":"http:\/\/www-users.cs.umn.edu\/~karypis\/metis\/."},{"key":"34_CR18","unstructured":"George Karypis and Vipin Kumar. A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, November 1997."},{"key":"34_CR19","unstructured":"http:\/\/www.cs.sandia.gov\/CRF\/chac.html."},{"key":"34_CR20","unstructured":"http:\/\/www.uni-paderborn.de\/cs\/robsy\/party.html."},{"key":"34_CR21","unstructured":"http:\/\/www.labri.u-bordeaux.fr\/Equipe\/ALiENor\/membre\/pelegrin\/scotch\/"},{"key":"34_CR22","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1049\/ip-map:19971197","volume":"144","author":"B. Chopard","year":"1997","unstructured":"B. Chopard, P.O. Luthi, and Jean-Fr\u00e9d\u00e9ric Wagen. A lattice boltzmann method for wave propagation in urban microcells. IEEE Proceedings-Microwaves, Antennas and Propagation, 144:251\u2013255, 1997.","journal-title":"IEEE Proceedings-Microwaves, Antennas and Propagation"}],"container-title":["Lecture Notes in Computer Science","High-Performance Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0100593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T07:49:05Z","timestamp":1736668145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0100593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540658214","9783540489337"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0100593","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}