{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:08Z","timestamp":1742617208346,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613329"},{"type":"electronic","value":"9783540684619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61332-3_152","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:33:53Z","timestamp":1330292033000},"page":"189-198","source":"Crossref","is-referenced-by-count":0,"title":["Fast separator decomposition for finite element meshes"],"prefix":"10.1007","author":[{"given":"Shang-Hua","family":"Teng","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"A. Agrawal and P. Klein. Cutting down on fill using nested dissection: provably good elimination orderings, In Sparse Matrix Computations: Graph Theory Issues and Algorithms, Springer-Verlag, 56 pp 31\u201356, 1993.","DOI":"10.1007\/978-1-4613-8369-7_2"},{"key":"20_CR2","unstructured":"N. Alon and J. H. Spencer and P. Erd\u00f6s. The Probabilistic Method, Wiley, 1992."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"M. Bern and D. Eppstein. Mesh generation and optimal triangulation, in Computing in Euclidean Geometry, World Scientific, pp 23\u201389, 1992.","DOI":"10.1142\/9789814355858_0002"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"M. Bern, D. Eppstein, and J. R. Gilbert. Provably good mesh generation. In 31st FOCS, pages 231\u2013241. IEEE, 1990.","DOI":"10.1109\/FSCS.1990.89542"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"T. F. Chan and B. Smith. Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes. Contemporary Mathematics, 1\u201314, 1993.","DOI":"10.1090\/conm\/180\/1970"},{"key":"20_CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02189314","volume":"9","author":"B. Chazelle","year":"1991","unstructured":"B. Chazelle. Cutting hyerplanes for divide and conquer. Disc, and Comput. Geom., 9:145\u2013158, 1991.","journal-title":"Disc, and Comput. Geom."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"K. Clarkson, D. Eppstein, G. L. Miller, C. Sturtivant, and S.-H. Teng. Approximating center points with iterated Radon points. In 9th ACM SoCG, pages 91\u201398, 1993.","DOI":"10.1145\/160985.161004"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, NY, 1987.","DOI":"10.1007\/978-3-642-61568-9"},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.2514\/3.6561","volume":"10","author":"I. Fried","year":"1972","unstructured":"I. Fried. Condition of finite element matrices generated from nonuniform meshes. AIAA J., 10:219\u2013221, 1972.","journal-title":"AIAA J."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"A. M. Frieze, G. L. Miller, and S.-H. Teng. Separator based divide and conquer in computational geometry. In SPAA, ACM, pages 420\u2013430, 1992.","DOI":"10.1145\/140901.141934"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/0710032","volume":"10","author":"J. A. George","year":"1973","unstructured":"J. A. George. Nested dissection of a regular finite element mesh. SIAM J. Numerical Analysis, 10:345\u2013363, 1973.","journal-title":"SIAM J. Numerical Analysis"},{"key":"20_CR12","unstructured":"A. George and J. W. H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, 1981."},{"issue":"4","key":"20_CR13","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01396660","volume":"50","author":"J. R. Gilbert","year":"1987","unstructured":"J. R. Gilbert and R. E. Tarjan. The analysis of a nested dissection algorithm. Numerische Mathematik, 50(4):377\u2013404, 1987.","journal-title":"Numerische Mathematik"},{"key":"20_CR14","unstructured":"J. R. Gilbert, G. L. Miller, and S.-H. Teng. Geometric mesh partitioning: Implementation and experiments. SIAM SISC, to appear 1996."},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"M. Goodrich. Planar separators and parallel polygon triangulation. In the 24 ACM STOC, 507\u2013516. 1994.","DOI":"10.1145\/129712.129762"},{"key":"20_CR16","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1990","unstructured":"T. Hagerup and C. R\u00fcb. A guided tour of Chernoff bounds. IPL, 33:305\u2013308, 1990.","journal-title":"IPL"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"W. Hoeffding. Probability inequalities for sums of bounded random variables. Amer. Stat. Assoc. J., 13\u201329, 1963.","DOI":"10.2307\/2282952"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"P. Klein, S. Rao, M. Rauch, and S. Subramanian. Faster shortest-path algorithms for planar graphs. In the 26 ACM STOC, 27\u201337. 1994.","DOI":"10.1145\/195058.195092"},{"key":"20_CR19","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM J. on NA, 16:346\u2013358, 1979.","journal-title":"SIAM J. on NA"},{"key":"20_CR20","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. of Appl. Math., 36:177\u2013189, April 1979.","journal-title":"SIAM J. of Appl. Math."},{"key":"20_CR21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/6497.6499","volume":"12","author":"J. W. H. Liu","year":"1986","unstructured":"J. W. H. Liu. A compact row storage scheme for cholesky factors using elimination trees. ACM Trans, on Math. Softw., 12:127\u2013148, 1986.","journal-title":"ACM Trans, on Math. Softw."},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J. W. H. Liu","year":"1990","unstructured":"J. W. H. Liu. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl., 11:134\u2013173, 1990.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis. Automatic mesh partitioning. Sparse Matrix Computations: Graph Theory Issues and Algorithms, Springer-Verlag, 56 pp 57\u201384, 1993.","DOI":"10.1007\/978-1-4613-8369-7_3"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"G. Strang and G. J. Fix. An Analysis of the Finite Element Method. Prentice-Hall, 1973.","DOI":"10.1016\/B978-0-12-068650-6.50030-7"},{"key":"20_CR25","unstructured":"R. E. Tarjan. Data Structures and Network Algorithms. SIAM, 1985."},{"key":"20_CR26","unstructured":"S.-H. Teng. Points, Spheres, and Separators: a unified geometric approach to graph partitioning. PhD thesis, 1991. CMU-CS-91-184."},{"key":"20_CR27","unstructured":"S.-H. Teng. Geometric approaches to hierarchical and adaptive computing with applications to multigrid and domain decomposition. In Fifth SIAM Applied Linear Algebra, 51\u201357, 1994."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61332-3_152.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:17:45Z","timestamp":1742599065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61332-3_152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613329","9783540684619"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-61332-3_152","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}