{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:09:20Z","timestamp":1725484160596},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437925"},{"type":"electronic","value":"9783540480860"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-48086-2_54","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T06:54:50Z","timestamp":1180335290000},"page":"493-501","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Empirical Comparison of Decomposition Algorithms for Complex Finite Element Meshes"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Jurczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"G\u0142ut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacek","family":"Kitowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,6]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. B.G. Teub-ner, 1990.","DOI":"10.1007\/978-3-322-92106-2_3"},{"key":"54_CR2","unstructured":"R.A. Davey. Decomposition of Unstructured Meshes for Efficient Parallel Computation. PhD thesis, University of Edinburgh, 1997."},{"key":"54_CR3","unstructured":"K. Schlogel, G. Karypis, and V. Kumar. Graph partitioning for high-performance scientific simulations. In J. Dongarra and et. al., editors, CRPCParallel Computing Handbook. Morgan Kaufmann, 2000."},{"key":"54_CR4","unstructured":"B. G\u0142ut, K. Boryczko, T. Jurczyk, W. Alda, and J. Kitowski. High quality 2D mesh generation based on Delaunay triangulation. In Proc. SGI Users\u2019 Int. Conf. SGI2000, pages 334\u2013343 Cracow, 2000."},{"key":"54_CR5","doi-asserted-by":"crossref","unstructured":"B.W. Kernighan and S. Lin. An effective heuristic procedure for partitioning graphs. The Bell Systems Technical Journal, pages 291\u2013308, Feb. 1970.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"issue":"2\/3","key":"54_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0956-0521(91)90014-V","volume":"2","author":"H.D. Simon","year":"1991","unstructured":"H.D. Simon. Partitioning of unstructured problems for parallel processing. Computing Systems in Engineering, 2(2\/3):135\u2013148, 1991.","journal-title":"Computing Systems in Engineering"},{"key":"54_CR7","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1002\/cpe.4330030502","volume":"3","author":"R.D. Williams","year":"1991","unstructured":"R.D. Williams. Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency, 3:457\u2013481, 1991.","journal-title":"Concurrency"},{"key":"54_CR8","volume-title":"Technical Report SAND93-0074","author":"B. Hendrickson","year":"1993","unstructured":"B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. Technical Report SAND93-0074, Sandia National Laboratories, Albuquerque, New Mexico 87185, 1993."},{"issue":"5","key":"54_CR9","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/0045-7949(88)90004-1","volume":"28","author":"C. Farhat","year":"1988","unstructured":"C. Farhat. A simple and efficient automatic FEM domain decomposer. Computers and Structures, 28(5):579\u2013602, 1988.","journal-title":"Computers and Structures"},{"key":"54_CR10","doi-asserted-by":"crossref","unstructured":"C.M. Fiduccia and R.M. Mattheyses. A linear-time heuristic for improving network partitions. In Proc. of the 19th IEEE Design Automation Conference, pages 175\u2013181, 1982.","DOI":"10.1109\/DAC.1982.1585498"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48086-2_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:21:43Z","timestamp":1558272103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48086-2_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437925","9783540480860"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-48086-2_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"6 June 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}