{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:03:48Z","timestamp":1725555828084},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642125348"},{"type":"electronic","value":"9783642125355"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12535-5_92","type":"book-chapter","created":{"date-parts":[[2010,5,8]],"date-time":"2010-05-08T15:53:31Z","timestamp":1273334011000},"page":"771-778","source":"Crossref","is-referenced-by-count":0,"title":["Factorization-Based Graph Repartitionings"],"prefix":"10.1007","author":[{"given":"Kate\u0159ina","family":"Jurkov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslav","family":"T\u016fma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"92_CR1","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/71.780863","volume":"20","author":"U.V. Cataly\u00fcrek","year":"1999","unstructured":"Cataly\u00fcrek, U.V., Aykanat, C.: Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication. IEEE Transactions on Parallel and Distributed Systems\u00a020, 673\u2013693 (1999)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"92_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1391989.1391995","volume":"35","author":"Y. Chen","year":"2008","unstructured":"Chen, Y., Davis, T.A., Hager, W.W., Rajamanickam, S.: Algorithm 887: CHOLMOD, Supernodal sparse Cholesky factorization and update\/downdate. ACM Trans. Math. Softw.\u00a035, 22:1\u201322:14 (2008)","journal-title":"ACM Trans. Math. Softw."},{"key":"92_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718881","volume-title":"Direct Methods for Sparse Linear Systems","author":"T.A. Davis","year":"2006","unstructured":"Davis, T.A.: Direct Methods for Sparse Linear Systems. SIAM, Philadelphia (2006)"},{"key":"92_CR4","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. Hendrickson","year":"1998","unstructured":"Hendrickson, B.: Graph partitioning and parallel solvers: Has the 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":"92_CR5","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput.\u00a020, 359\u2013392 (1999)","journal-title":"SIAM J. Sci. Comput."},{"key":"92_CR6","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":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal\u00a049, 291\u2013307 (1970)","journal-title":"The Bell System Technical Journal"},{"key":"92_CR7","unstructured":"Kumar, V., Grama, A., Gupta, A., Karypis, G.: Introduction to Parallel Computing. Benjamin-Cummings (1994)"},{"key":"92_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/0609003","volume":"9","author":"J.W.H. Liu","year":"1988","unstructured":"Liu, J.W.H.: A tree model for sparse symmetric indefinite matrix factorization. SIAM J. Matrix Anal. Appl.\u00a09, 26\u201339 (1988)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"92_CR9","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1137\/0910069","volume":"10","author":"J.W.H. Liu","year":"1989","unstructured":"Liu, J.W.H.: The minimum degree ordering with constraints. SIAM J. Sci. Comput.\u00a010, 1136\u20131145 (1989)","journal-title":"SIAM J. Sci. Comput."},{"key":"92_CR10","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W.H. Liu","year":"1990","unstructured":"Liu, J.W.H.: The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl.\u00a011, 134\u2013172 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"92_CR11","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1137\/0614019","volume":"14","author":"J.W.H. Liu","year":"1993","unstructured":"Liu, J.W.H., Ng, E.G., Peyton, B.W.: On finding supernodes for sparse matrix computations. SIAM J. Matrix Anal. Appl.\u00a014, 242\u2013252 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"92_CR12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1137\/1.9780898718133.ch7","volume-title":"Parallel Processing for Scientific Computing","author":"A. Pinar","year":"2006","unstructured":"Pinar, A., Hendrickson, B.: Combinatorial Parallel and Scientific Computing. In: Heroux, M., Raghavan, P., Simon, H. (eds.) Parallel Processing for Scientific Computing, pp. 127\u2013141. SIAM, Philadelphia (2006)"},{"key":"92_CR13","doi-asserted-by":"crossref","unstructured":"Pinar, A., Hendrickson, B.: Partitioning for complex objectives. In: Parallel and Distributed Processing Symposium, vol.\u00a03, pp. 1232\u20131237 (2001)","DOI":"10.1109\/IPDPS.2001.925098"},{"key":"92_CR14","volume-title":"Proceedings of the ACM\/IEEE Symposium on Supercomputing","author":"K. Schloegel","year":"2000","unstructured":"Schloegel, K., Karypis, G., Kumar, V.: A unified algorithm for load-balancing adaptive scientific simulations. In: Proceedings of the ACM\/IEEE Symposium on Supercomputing, vol.\u00a059. ACM, New York (2000)"}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12535-5_92.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:42:49Z","timestamp":1619782969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12535-5_92"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642125348","9783642125355"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12535-5_92","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}