{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:25:04Z","timestamp":1743006304799,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653875"},{"type":"electronic","value":"9783540493723"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49372-7_9","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:53:17Z","timestamp":1187254397000},"page":"95-106","source":"Crossref","is-referenced-by-count":4,"title":["An Object-Oriented Collection of Minimum Degree Algorithms"],"prefix":"10.1007","author":[{"given":"Gary","family":"Kumfert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Pothen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,15]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/1003021","volume":"3","author":"S. Parter","year":"1961","unstructured":"S. Parter. The use of planar graphs in Gaussian elimination. SIAM Rev., 3:364\u2013369, 1961.","journal-title":"SIAM Rev."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"M. Yannakakis. Computing the minimum fill-in is NP-complete. SIAM J. Algebraic and Discrete Methods, pages 77\u201379, 1981.","DOI":"10.1137\/0602010"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/214392.214398","volume":"11","author":"J. W. H. Liu","year":"1985","unstructured":"Joseph W. H. Liu. Modification of the minimum-degree algorithm by multiple elimination. ACM Trans. on Math. Software, 11:141\u2013153, 1985.","journal-title":"ACM Trans. on Math. Software"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"P. Amestoy","year":"1996","unstructured":"Patrick Amestoy, Timothy A. Davis, and Iain S. Duff. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl., 17(4):886\u2013905, 1996.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9_CR5","unstructured":"Ed Rothberg. Ordering sparse matrices using approximate minimum local fill. Preprint, April 1996."},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1137\/S0895479896302692","volume":"19","author":"E. Rothberg","year":"1998","unstructured":"Ed Rothberg and Stan Eisenstat. Node selection strategies for bottom-up sparse matrix ordering. SIAM J. Matrix Anal. Appl., 19(3):682\u2013695, 1998.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9_CR7","unstructured":"Esmond G. Ng and Padma Raghavan. Performance of greedy ordering heuristics for sparse Cholesky factorization. Submitted to SIAM J. Mat. Anal. and Appl., 1997."},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/1031001","volume":"31","author":"A. George","year":"1989","unstructured":"Alan George and Joeseph W. H. Liu. The evolution of the minimum degree algorithm. SIAM Rev., 31(1):1\u201319, 1989.","journal-title":"SIAM Rev."},{"issue":"6","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1137\/0916081","volume":"16","author":"C. Ashcraft","year":"1995","unstructured":"Cleve Ashcraft. Compressed graphs and the minimum degree algorithm. SIAM J. Sci. Comput., 16(6):1404\u20131411, 1995.","journal-title":"SIAM J. Sci. Comput."},{"key":"9_CR10","unstructured":"Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison Wesley Professional Computing Series. Addison Wesley Longman, 1995."}],"container-title":["Lecture Notes in Computer Science","Computing in Object-Oriented Parallel Environments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49372-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:42:29Z","timestamp":1556757749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49372-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653875","9783540493723"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-49372-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}