{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:47:20Z","timestamp":1725511640970},"publisher-location":"Berlin, Heidelberg","reference-count":64,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540713500"},{"type":"electronic","value":"9783540713517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71351-7_21","type":"book-chapter","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T18:48:52Z","timestamp":1180464532000},"page":"260-280","source":"Crossref","is-referenced-by-count":9,"title":["Combinatorial Scientific Computing: The Enabling Power of Discrete Algorithms in Computational Science"],"prefix":"10.1007","author":[{"given":"Bruce","family":"Hendrickson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Pothen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"P.R. Amestoy","year":"1996","unstructured":"Amestoy, P.R., Davis, T.A., Duff, I.S.: An approximate minimum degree ordering algorithm. SIAM Journal on Matrix Analysis and Applications\u00a017(4), 886\u2013905 (1996)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"2","key":"21_CR2","first-page":"27","volume":"4","author":"G.D. Bader","year":"2003","unstructured":"Bader, G.D., Hogue, C.W.V.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics\u00a04(2), 27 (2003)","journal-title":"BMC Bioinformatics"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0010-4655(99)00313-6","volume":"121","author":"S. Bastea","year":"1999","unstructured":"Bastea, S., et al.: Combinatorial optimization methods in disordered systems. Computer Phys. Comm.\u00a0121, 199\u2013205 (1999)","journal-title":"Computer Phys. Comm."},{"key":"21_CR4","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11560500_20","volume-title":"Computational Life Sciences","author":"M. Bauer","year":"2005","unstructured":"Bauer, M., Klau, G.W., Reinert, K.: Fast and accurate structural RNA alignment by progressive Langrangian optimization. In: Berthold, M.R., et al. (eds.) CompLife 2005. LNCS (LNBI), vol.\u00a03695, pp. 217\u2013228. Springer, Heidelberg (2005)"},{"key":"21_CR5","volume-title":"Exactly solved models in statistical mechanics","author":"R.J. Baxter","year":"1982","unstructured":"Baxter, R.J.: Exactly solved models in statistical mechanics. Academic Press, London (1982)"},{"key":"21_CR6","volume-title":"Understanding Search Engines: Mathematical Modeling and Text Retrieval","author":"M.W. Berry","year":"1999","unstructured":"Berry, M.W., Browne, M.: Understanding Search Engines: Mathematical Modeling and Text Retrieval. SIAM, Philadelphia (1999)"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1137\/S0895479801390637","volume":"25","author":"E.G. Boman","year":"2003","unstructured":"Boman, E.G., Hendrickson, B.: Support theory for preconditioning. SIAM J. Matrix Anal. Appl.\u00a025(3), 694\u2013717 (2003)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"7","key":"21_CR8","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/71.780863","volume":"10","author":"\u00dc. \u00c7ataly\u00fcrek","year":"1999","unstructured":"\u00c7ataly\u00fcrek, \u00dc., Aykanat, C.: Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Parallel Distrib. Syst.\u00a010(7), 673\u2013693 (1999)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"21_CR9","unstructured":"\u00c7ataly\u00fcrek, \u00dc., Aykanat, C.: PaToH: a multilevel hypergraph partitioning tool for decomposing sparse matrices and partitioning VLSI circuits. Technical Report BU\u2013CEIS\u20139902, Dept. Computer Engineering and Information Science, Bilkent Univ., Turkey (1999)"},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0607026","volume":"7","author":"T.F. Coleman","year":"1986","unstructured":"Coleman, T.F., Cai, J.: The cyclic coloring problem and estimation of sparse Hessian matrices. SIAM J. Alg. Disc. Meth.\u00a07(2), 221\u2013235 (1986)","journal-title":"SIAM J. Alg. Disc. Meth."},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0720013","volume":"20","author":"T.F. Coleman","year":"1983","unstructured":"Coleman, T.F., Mor\u00e9, J.J.: Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal.\u00a020(1), 187\u2013209 (1983)","journal-title":"SIAM J. Numer. Anal."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF02612334","volume":"28","author":"T.F. Coleman","year":"1984","unstructured":"Coleman, T.F., Mor\u00e9, J.J.: Estimation of sparse Hessian matrices and graph coloring problems. Math. Program.\u00a028, 243\u2013270 (1984)","journal-title":"Math. Program."},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1137\/S1064827595295349","volume":"19","author":"T.F. Coleman","year":"1998","unstructured":"Coleman, T.F., Verma, A.: The efficient computation of sparse Jacobian matrices using automatic differentiation. SIAM J. Sci. Comput.\u00a019(4), 1210\u20131233 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1093\/imamat\/13.1.117","volume":"13","author":"A.R. Curtis","year":"1974","unstructured":"Curtis, A.R., Powell, M.J.D., Reid, J.K.: On the estimation of sparse Jacobian matrices. J. Inst. Math. Appl.\u00a013, 117\u2013119 (1974)","journal-title":"J. Inst. Math. Appl."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1137\/040615729","volume":"27","author":"H. Sterck De","year":"2006","unstructured":"De Sterck, H., Yang, U.M., Heys, J.J.: Reducing complexity in parallel algebraic multigrid preconditioners. SIAM J. Matrix Anal. Appl.\u00a027, 1019\u20131039 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"6","key":"21_CR16","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S. Deerwester","year":"1990","unstructured":"Deerwester, S., et al.: Indexing by latent semantic analysis. J. Amer. Soc. Information Sci.\u00a041(6), 391\u2013407 (1990)","journal-title":"J. Amer. Soc. Information Sci."},{"key":"21_CR17","volume-title":"Proc. IPDPS\u201906","author":"K.D. Devine","year":"2006","unstructured":"Devine, K.D., et al.: Parallel hypergraph partitioning for scientific computing. In: Proc. IPDPS\u201906, IEEE Computer Society Press, Los Alamitos (2006)"},{"issue":"4","key":"21_CR18","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S0895479897317661","volume":"20","author":"I.S. Duff","year":"1999","unstructured":"Duff, I.S., Koster, J.K.: The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM Journal on Matrix Analysis and Applications\u00a020(4), 889\u2013901 (1999)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"21_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511790492","volume-title":"Biological Sequence Analysis","author":"R. Durbin","year":"1998","unstructured":"Durbin, R., et al.: Biological Sequence Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"21_CR20","volume-title":"Protein Bioinformatics: An algorithmic approach to sequence and structure analysis","author":"I. Eidhammer","year":"2004","unstructured":"Eidhammer, I., Jonassen, I., Taylor, W.R.: Protein Bioinformatics: An algorithmic approach to sequence and structure analysis. Wiley, Chichester (2004)"},{"issue":"4","key":"21_CR21","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1137\/S0036144504444711","volume":"47","author":"A.H. Gebremedhin","year":"2005","unstructured":"Gebremedhin, A.H., Manne, F., Pothen, A.: What color is your Jacobian? Graph coloring for computing derivatives. SIAM Review\u00a047(4), 629\u2013705 (2005)","journal-title":"SIAM Review"},{"key":"21_CR22","unstructured":"Gebremedhin, A., et al.: New acyclic and star coloring algorithms with application to Hessian computations. Technical report, Old Dominion University, Norfolk, VA (March 2005)"},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/0710032","volume":"10","author":"A. George","year":"1973","unstructured":"George, A.: Nested dissection of a regular finite element mesh. SIAM Journal on Numerical Analysis\u00a010, 345\u2013363 (1973)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/1031001","volume":"31","author":"A. George","year":"1989","unstructured":"George, A., Liu, J.W.H.: The evolution of the minimum-degree ordering algorithm. SIAM Review\u00a031, 1\u201319 (1989)","journal-title":"SIAM Review"},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1137\/0614024","volume":"14","author":"J.R. Gilbert","year":"1993","unstructured":"Gilbert, J.R., Liu, J.W.H.: Elimination structures for unsymmetric sparse LU factors. SIAM Journal on Matrix Analysis and Applications\u00a014, 334\u2013352 (1993)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"21_CR26","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-1-4613-8369-7_6","volume-title":"Graph Theory and Sparse Matrix Computation","author":"J.R. Gilbert","year":"1993","unstructured":"Gilbert, J.R., Ng, E.G.: Predicting structure in nonsymmetric sparse matrix factorizations. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 107\u2013139. Springer, Heidelberg (1993)"},{"key":"21_CR27","unstructured":"Gremban, K.: Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems. PhD thesis, School of Computer Science, Carnegie-Mellon University, Available as Tech. Report CMU-CS-96-123 (1996)"},{"key":"21_CR28","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"21_CR29","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1038\/35011540","volume":"402","author":"L.H. Hartwell","year":"1999","unstructured":"Hartwell, L.H., Hopfeld, J.J., Murray, A.W.: From molecular to modular cell biology. Nature\u00a0402, C47\u2013C52 (1999)","journal-title":"Nature"},{"key":"21_CR30","unstructured":"Hendrickson, B.: Latent semantic analysis and Fiedler retrieval. Submitted for publication to Lin. Alg. Appl. Earlier version in Proc. SIAM Workshop on Text Mining\u201906 (2006)"},{"key":"21_CR31","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/S0167-8191(00)00048-X","volume":"26","author":"B. Hendrickson","year":"2000","unstructured":"Hendrickson, B., Kolda, T.: Graph partitioning models for parallel computing. Parallel Comput.\u00a026, 1519\u20131534 (2000)","journal-title":"Parallel Comput."},{"key":"21_CR32","unstructured":"Hendrickson, B., Leland, R.: The Chaco user\u2019s guide: Version 2.0. Technical Report SAND94\u20132692, Sandia National Labs, Albuquerque, NM (June 1995)"},{"key":"21_CR33","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/10556789808805700","volume":"10","author":"S. Hossain","year":"1998","unstructured":"Hossain, S., Steihaug, T.: Computing a sparse Jacobian matrix by rows and columns. Optimization Methods and Software\u00a010, 33\u201348 (1998)","journal-title":"Optimization Methods and Software"},{"key":"21_CR34","unstructured":"Johnson, D.S.: Challenges for theoretical computer science: Draft (2000), http:\/\/www.research.att.com\/~dsj\/nsflist.html"},{"key":"21_CR35","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1137\/S106482759528065X","volume":"18","author":"M.T. Jones","year":"1997","unstructured":"Jones, M.T., Plassmann, P.E.: Parallel algorithms for adaptive mesh refinement. SIAM J. Scientific Computing\u00a018, 686\u2013708 (1997)","journal-title":"SIAM J. Scientific Computing"},{"key":"21_CR36","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report CORR 95\u2013035, University of Minnesota, Dept. Computer Science, Minneapolis, MN (June 1995)"},{"key":"21_CR37","unstructured":"Karypis, G., Kumar, V.: Parmetis: Parallel graph partitioning and sparse matrix ordering library. Technical Report 97-060, Department of Computer Science, University of Minnesota (1997)"},{"key":"21_CR38","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/nla.317","volume":"10","author":"H. Kim","year":"2002","unstructured":"Kim, H., Zu, J., Zikatanov, L.: A multigrid method based on graph matching for convection-diffusion equations. Numerical Lin. Alg. Appl.\u00a010, 181\u2013195 (2002)","journal-title":"Numerical Lin. Alg. Appl."},{"issue":"5","key":"21_CR39","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J. Kleinberg","year":"1999","unstructured":"Kleinberg, J.: Authoritative sources in a hyperlinked environment. J. ACM\u00a046(5), 604\u2013632 (1999)","journal-title":"J. ACM"},{"key":"21_CR40","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics\u00a036, 177\u2013189 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"21_CR41","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 Journal on Matrix Analysis and Applications\u00a011, 134\u2013172 (1990)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"21_CR42","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02592052","volume":"26","author":"S.T. McCormick","year":"1983","unstructured":"McCormick, S.T.: Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Math. Program.\u00a026, 153\u2013171 (1983)","journal-title":"Math. Program."},{"key":"21_CR43","unstructured":"Owen, S.J.: A survey of unstructured mesh generation technology. In: Proc. 7th Intl. Meshing Roundtable (1998)"},{"key":"21_CR44","unstructured":"Page, L., et al.: The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project (1998)"},{"key":"21_CR45","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/1003021","volume":"3","author":"S.V. Parter","year":"1961","unstructured":"Parter, S.V.: The use of linear graphs in Gaussian elimination. SIAM Review\u00a03, 119\u2013130 (1961)","journal-title":"SIAM Review"},{"key":"21_CR46","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2022.001.0001","volume-title":"Computational Molecular Biology: An algorithmic approach","author":"P.A. Pevzner","year":"2000","unstructured":"Pevzner, P.A.: Computational Molecular Biology: An algorithmic approach. MIT Press, Cambridge (2000)"},{"key":"21_CR47","volume-title":"Proc. ACM and IEEE International Conference on Supercomputing (SC99)","author":"A. P\u0131nar","year":"1999","unstructured":"P\u0131nar, A., Heath, M.T.: Improving performance of sparse matrix\u2013vector multiplication. In: Proc. ACM and IEEE International Conference on Supercomputing (SC99), ACM Press, New York (1999)"},{"key":"21_CR48","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0306-4573(76)90048-0","volume":"12","author":"G. Pinski","year":"1957","unstructured":"Pinski, G., Narin, F.: Citation influence for journal aggregates of scientific publications: Theory, with applications to the literature of physics. Inf. Proc. and Management\u00a012, 297\u2013312 (1957)","journal-title":"Inf. Proc. and Management"},{"key":"21_CR49","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1145\/98267.98287","volume":"16","author":"A. Pothen","year":"1990","unstructured":"Pothen, A., Fan, C.-J.: Computing the block triangular form of a sparse matrix. ACM Transactions on Mathematical Software\u00a016, 303\u2013324 (1990)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"21_CR50","volume-title":"Handbook on Data Structures and Applications","author":"A. Pothen","year":"2004","unstructured":"Pothen, A., Toledo, S.: Elimination structures in scientific computing. In: Mehta, D., Sahni, S. (eds.) Handbook on Data Structures and Applications, pp. 59.1\u201359.29. CRC Press, Boca Raton (2004)"},{"issue":"6","key":"21_CR51","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1137\/0716078","volume":"16","author":"M.J.D. Powell","year":"1979","unstructured":"Powell, M.J.D., Toint, P.L.: On the estimation of sparse Hessian matrices. SIAM J. Numer. Anal.\u00a016(6), 1060\u20131074 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"21_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-49116-3_24","volume-title":"STACS 99","author":"R. Preis","year":"1999","unstructured":"Preis, R.: Linear-time 1\/2- approximation algorithm for maximum weighted matching in general graphs. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 259\u2013269. Springer, Heidelberg (1999)"},{"key":"21_CR53","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11560500_24","volume-title":"Computational Life Sciences","author":"E. Ramadan","year":"2005","unstructured":"Ramadan, E., Osgood, C., Pothen, A.: The architecture of a proteomic network in the yeast. In: Berthold, M.R., et al. (eds.) CompLife 2005. LNCS (LNBI), vol.\u00a03695, pp. 265\u2013276. Springer, Heidelberg (2005)"},{"issue":"3","key":"21_CR54","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1021\/ci000095o","volume":"41","author":"M. Randic","year":"2001","unstructured":"Randic, M., Zupan, J.: On interpretation of well-known topological indices. J. Chem. Inf. Comput. Sci.\u00a041(3), 550\u2013560 (2001)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"21_CR55","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/B978-1-4832-3187-7.50018-0","volume-title":"Graph Theory and Computing","author":"D.J. Rose","year":"1972","unstructured":"Rose, D.J.: A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In: Read, R.C. (ed.) Graph Theory and Computing, pp. 183\u2013217. Academic Press, New York (1972)"},{"key":"21_CR56","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing\u00a05, 266\u2013283 (1976)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR57","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative methods for sparse linear systems","author":"Y. Saad","year":"2003","unstructured":"Saad, Y.: Iterative methods for sparse linear systems, 2nd edn. SIAM, Philadelphia (2003)","edition":"2"},{"key":"21_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0014497","volume-title":"Applied Computational Geometry. Towards Geometric Engineering","author":"J. Shewchuk","year":"1996","unstructured":"Shewchuk, J.: Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In: Lin, M.C., Manocha, D. (eds.) FCRC-WS 1996 and WACG 1996. LNCS, vol.\u00a01148, pp. 203\u2013222. Springer, Heidelberg (1996)"},{"key":"21_CR59","volume-title":"Proc. 36th ACM Symp. Theory of Comput.","author":"D. Spielman","year":"2004","unstructured":"Spielman, D., Teng, S.-H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proc. 36th ACM Symp. Theory of Comput., ACM Press, New York (2004)"},{"key":"21_CR60","doi-asserted-by":"publisher","first-page":"64","DOI":"10.2307\/2369436","volume":"1","author":"J.J. Sylvester","year":"1878","unstructured":"Sylvester, J.J.: On an application of the new atomic theory to the graphical representation of the invariants and covariants of binary quantics: With three appendices. Amer. J. Mathematics\u00a01, 64\u2013128 (1878)","journal-title":"Amer. J. Mathematics"},{"key":"21_CR61","doi-asserted-by":"publisher","first-page":"3327","DOI":"10.1002\/(SICI)1097-0207(19961015)39:19<3327::AID-NME2>3.0.CO;2-H","volume":"39","author":"T.G. Tautges","year":"1996","unstructured":"Tautges, T.G., Blacker, T., Mitchell, S.A.: The whisker weaving algorithm: A connectivity-based method for constructing all-hexahedral finite element meshes. Intl. J. Numerical Methods Engng.\u00a039, 3327\u20133349 (1996)","journal-title":"Intl. J. Numerical Methods Engng."},{"key":"21_CR62","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0022-3093(83)90424-6","volume":"57","author":"M.F. Thorpe","year":"1983","unstructured":"Thorpe, M.F.: Continuous deformations in random networks. J. Non-Cryst. Solids\u00a057, 355\u2013370 (1983)","journal-title":"J. Non-Cryst. Solids"},{"key":"21_CR63","unstructured":"Trefethen, L.N.: Numerical analysis. In: Gowers, T., Barrow-Green, J. (eds.) Princeton Companion to Mathematics, Princeton University Press, Princeton (To appear, 2006)"},{"key":"21_CR64","volume-title":"A new kind of science","author":"S. Wolfram","year":"2002","unstructured":"Wolfram, S.: A new kind of science. Wolfram Media, Champaign (2002)"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing for Computational Science - VECPAR 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71351-7_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:19:11Z","timestamp":1605763151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71351-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540713500","9783540713517"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71351-7_21","relation":{},"subject":[]}}