{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:35:37Z","timestamp":1757615737048,"version":"3.44.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,3,26]],"date-time":"2003-03-26T00:00:00Z","timestamp":1048636800000},"content-version":"vor","delay-in-days":5563,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1988,1]]},"DOI":"10.1016\/0020-0190(88)90191-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"325-328","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":14,"title":["Some nested dissection order is nearly optimal"],"prefix":"10.1016","volume":"26","author":[{"given":"John Russell","family":"Gilbert","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"1987","series-title":"On the performance of the minimal degree heuristic for Gaussian elimination","author":"Berman","key":"10.1016\/0020-0190(88)90191-3_BIB1"},{"key":"10.1016\/0020-0190(88)90191-3_BIB2","first-page":"181","article-title":"Graph bisection algorithms with good average case behavior","author":"Bui","year":"1984","journal-title":"Proc. 25th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(88)90191-3_BIB3","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1137\/0715069","article-title":"An automatic nested dissection algorithm for irregular finite element problems","volume":"15","author":"George","year":"1978","journal-title":"SIAM J. Numer. Anal."},{"year":"1981","series-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"George","key":"10.1016\/0020-0190(88)90191-3_BIB4"},{"key":"10.1016\/0020-0190(88)90191-3_BIB5","series-title":"Ph.D. Thesis","article-title":"Graph Separator Theorems and Sparse Gaussian Elimination","author":"Gilbert","year":"1980"},{"key":"10.1016\/0020-0190(88)90191-3_BIB6","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","article-title":"A separator theorem for graphs of bounded genus","volume":"5","author":"Gilbert","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(88)90191-3_BIB7","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0605032","article-title":"A separator theorem for chordal graphs","volume":"5","author":"Gilbert","year":"1984","journal-title":"SIAM J. Algebraic & Discrete Methods"},{"key":"10.1016\/0020-0190(88)90191-3_BIB8","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01396660","article-title":"The analysis of a nested dissection algorithm","volume":"50","author":"Gilbert","year":"1987","journal-title":"Numer. Math."},{"key":"10.1016\/0020-0190(88)90191-3_BIB9","first-page":"185","article-title":"Sur les assemblages de lignes","volume":"70","author":"Jordan","year":"1869","journal-title":"J. f. Reine & Angew. Math."},{"key":"10.1016\/0020-0190(88)90191-3_BIB10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0020-0190(88)90191-3_BIB11","first-page":"169","article-title":"On minimum parallel computing times for Gaussian elimination","volume":"40","author":"Leuze","year":"1983","journal-title":"Congressus Numerantium"},{"key":"10.1016\/0020-0190(88)90191-3_BIB12","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","article-title":"Generalized nested dissection","volume":"16","author":"Lipton","year":"1979","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0020-0190(88)90191-3_BIB13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","article-title":"A separator theorem for planar graphs","volume":"36","author":"Lipton","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0020-0190(88)90191-3_BIB14","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0167-8191(86)90014-1","article-title":"Computational models and task scheduling for parallel sparse Cholesky factorization","volume":"3","author":"Liu","year":"1986","journal-title":"Parallel Computing"},{"key":"10.1016\/0020-0190(88)90191-3_BIB15","series-title":"Graph Theory and Computing","first-page":"183","article-title":"A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations","author":"Rose","year":"1972"},{"key":"10.1016\/0020-0190(88)90191-3_BIB16","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(88)90191-3_BIB17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","article-title":"Computing the minimum fill-in is NP-complete","volume":"2","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Algebraic & Discrete Methods"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901913?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901913?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T14:58:59Z","timestamp":1757084339000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019088901913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,1]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1988,1]]}},"alternative-id":["0020019088901913"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90191-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1988,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Some nested dissection order is nearly optimal","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(88)90191-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}