{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:52Z","timestamp":1794381112248,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540229247","type":"print"},{"value":"9783540278665","type":"electronic"}],"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"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","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":[[2004]]},"DOI":"10.1007\/978-3-540-27866-5_96","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T16:20:42Z","timestamp":1284654042000},"page":"734-741","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method"],"prefix":"10.1007","author":[{"given":"Ond\u0159ej","family":"Medek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pavel","family":"Tvrd\u00edk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jaroslav","family":"Kruis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"96_CR1","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A. George","year":"1981","unstructured":"George, A., Liu, J.: Computer Solution of Large Sparse Positive Definite Systems. Prentice Hall, Englewood Cliffs (1981)"},{"key":"96_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/BFb0018541","volume-title":"Solving Irregularly Structured Problems in Parallel","author":"B. Hendricson","year":"1998","unstructured":"Hendricson, B.: Graph partitioning and parallel solvers: Has emperor no clothes? In: Ferreira, A., Rolim, J.D.P., Teng, S.-H. (eds.) IRREGULAR 1998. LNCS, vol.\u00a01457, pp. 218\u2013225. Springer, Heidelberg (1998)"},{"key":"96_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0307-904X(00)00042-1","volume":"25","author":"B. Hendricson","year":"2000","unstructured":"Hendricson, B.: Load balancing fictions, falsehoods and fallacies. Applied Mathematical Modelling\u00a025, 99\u2013108 (2000)","journal-title":"Applied Mathematical Modelling"},{"key":"96_CR4","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 J. Sci. Comput.\u00a020, 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"96_CR5","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. J. of Parallel and Distrib. Comput.\u00a048, 96\u2013129 (1998)","journal-title":"J. of Parallel and Distrib. Comput."},{"key":"96_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/224170.224228","volume-title":"Proceedings of the 1995 ACM\/IEEE conference on Supercomputing (CDROM)","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proceedings of the 1995 ACM\/IEEE conference on Supercomputing (CDROM), p. 28. ACM Press, New York (1995)"},{"key":"96_CR7","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, 63\u201380 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"96_CR8","doi-asserted-by":"crossref","unstructured":"Pellegrini, F.: Static mapping by dual recursive bipartitioning of process and architecture graphs. In: SHPCC 1994, pp. 486\u2013493 (1994)","DOI":"10.1007\/3-540-61142-8_588"},{"key":"96_CR9","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/BF02510240","volume":"37","author":"G. Kumfert","year":"1997","unstructured":"Kumfert, G., Pothen, A.: Two improved algorithms for envelope and wavefront reduction. BIT\u00a037, 559\u2013590 (1997)","journal-title":"BIT"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2004 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27866-5_96","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T08:34:16Z","timestamp":1589877256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27866-5_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229247","9783540278665"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27866-5_96","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99409","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}