{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T20:11:57Z","timestamp":1761941517392,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032096449","type":"print"},{"value":"9783032096456","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09645-6_19","type":"book-chapter","created":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T20:06:55Z","timestamp":1761941215000},"page":"360-379","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Choosing Variable Orderings Based on\u00a0Elimination Tree for\u00a0Sparse Triangular Decomposition"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-8118-8823","authenticated-orcid":false,"given":"Zhaoxing","family":"Qi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2834-3200","authenticated-orcid":false,"given":"Linpeng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,1]]},"reference":[{"issue":"10","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1016\/j.jsc.2011.12.043","volume":"47","author":"T B\u00e4chler","year":"2012","unstructured":"B\u00e4chler, T., Gerdt, V., Lange-Hegermann, M., Robertz, D.: Algorithmic Thomas decomposition of algebraic and differential systems. J. Symb. Comput. 47(10), 1233\u20131266 (2012)","journal-title":"J. Symb. Comput."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s00453-004-1084-3","volume":"39","author":"A Berry","year":"2004","unstructured":"Berry, A., Blair, J.R., Heggernes, P., Peyton, B.W.: Maximum cardinality search for computing minimal triangulations of graphs. Algorithmica 39, 287\u2013298 (2004)","journal-title":"Algorithmica"},{"key":"19_CR3","first-page":"1","volume-title":"Graph Theory and Sparse Matrix Computation","author":"JRS Blair","year":"1993","unstructured":"Blair, J.R.S., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 1\u201329. Springer, New York (1993)"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s11424-008-9103-0","volume":"21","author":"F Chai","year":"2008","unstructured":"Chai, F., Gao, X.S., Yuan, C.: A characteristic set method for solving boolean equations and applications in cryptanalysis of stream ciphers. J. Syst. Sci. Complexity 21(2), 191\u2013208 (2008)","journal-title":"J. Syst. Sci. Complexity"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-030-52200-1_3","volume-title":"Mathematical Software \u2013 ICMS 2020","author":"C Chen","year":"2020","unstructured":"Chen, C.: Chordality preserving incremental triangular decomposition and its implementation. In: Bigatti, A.M., Carette, J., Davenport, J.H., Joswig, M., de Wolff, T. (eds.) ICMS 2020. LNCS, vol. 12097, pp. 27\u201336. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52200-1_3"},{"issue":"6","key":"19_CR6","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.jsc.2011.12.023","volume":"47","author":"C Chen","year":"2012","unstructured":"Chen, C., Moreno Maza, M.: Algorithms for computing triangular decompositions of polynomial systems. J. Symb. Comput. 47(6), 610\u2013642 (2012)","journal-title":"J. Symb. Comput."},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/16M106995X","volume":"1","author":"D Cifuentes","year":"2017","unstructured":"Cifuentes, D., Parrilo, P.: Chordal networks of polynomial ideals. SIAM J. Appl. Algebra Geom. 1(1), 73\u2013110 (2017)","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Dong, M., Mou, C.: Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition. In: Computer Algebra in Scientific Computing, pp. 124\u2013142. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-14788-3_8"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Gallo, G., Mishra, B.: Efficient algorithms and bounds for Wu-Ritt characteristic sets. In: Effective Methods in Algebraic Geometry, pp. 119\u2013142. Springer, Boston (1991)","DOI":"10.1007\/978-1-4612-0441-1_8"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Gao, X.S., Chou, S.C.: Solving parametric algebraic systems. In: Proceedings of ISSAC 1992, pp. 335\u2013341. ACM, New York (1992)","DOI":"10.1145\/143242.143348"},{"issue":"6","key":"19_CR11","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/j.jsc.2011.12.025","volume":"47","author":"XS Gao","year":"2012","unstructured":"Gao, X.S., Huang, Z.: Characteristic set algorithms for equation solving in finite fields. J. Symb. Comput. 47(6), 655\u2013679 (2012)","journal-title":"J. Symb. Comput."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Ju, W., Mou, C.: Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition. In: International Conference on Algorithms for Computational Biology, pp. 29\u201341. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-74432-8_3"},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/jsco.1993.1011","volume":"15","author":"M Kalkbrener","year":"1993","unstructured":"Kalkbrener, M.: A generalized Euclidean algorithm for computing triangular representations of algebraic varieties. J. Symb. Comput. 15(2), 143\u2013167 (1993)","journal-title":"J. Symb. Comput."},{"issue":"1\u20133","key":"19_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0166-218X(91)90113-B","volume":"33","author":"D Lazard","year":"1991","unstructured":"Lazard, D.: A new method for solving algebraic systems of positive dimension. Discret. Appl. Math. 33(1\u20133), 147\u2013160 (1991)","journal-title":"Discret. Appl. Math."},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.jsc.2022.10.009","volume":"116","author":"H Li","year":"2023","unstructured":"Li, H., Xia, B., Zhang, H., Zheng, T.: Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure. J. Symb. Comput. 116, 324\u2013344 (2023)","journal-title":"J. Symb. Comput."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Mou, C.: Symbolic detection of steady states of autonomous differential biological systems by transformation into block triangular form. In: International Conference on Algorithms for Computational Biology, pp. 115\u2013127. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-91938-6_10"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Mou, C., Bai, Y.: On the chordality of polynomial sets in triangular decomposition in top-down style. In: Proceedings of ISSAC 2018, pp. 287\u2013294. ACM, New York (2018)","DOI":"10.1145\/3208976.3208997"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.jsc.2019.10.011","volume":"102","author":"C Mou","year":"2021","unstructured":"Mou, C., Bai, Y., Lai, J.: Chordal graphs in triangular decomposition in top-down style. J. Symb. Comput. 102, 108\u2013131 (2021)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1109\/TCBB.2022.3156759","volume":"20","author":"C Mou","year":"2023","unstructured":"Mou, C., Ju, W.: Sparse triangular decomposition for computing equilibria of biological dynamic systems based on chordal graphs. IEEE\/ACM Trans. Comput. Biol. Bioinf. 20(3), 1667\u20131678 (2023). https:\/\/doi.org\/10.1109\/TCBB.2022.3156759","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2012.11.009","volume":"468","author":"C Mou","year":"2013","unstructured":"Mou, C., Wang, D., Li, X.: Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case. Theoret. Comput. Sci. 468, 102\u2013113 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.jsc.2012.05.008","volume":"50","author":"A Poteaux","year":"2013","unstructured":"Poteaux, A., Schost, \u00c9.: On the complexity of computing with zero-dimensional triangular sets. J. Symb. Comput. 50, 110\u2013138 (2013)","journal-title":"J. Symb. Comput."},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Qi, Z., Mou, C.: Complexity analysis of triangular decomposition over $$F_2$$ with strongly chordal graphs. In: Proceedings of ISSAC 2024, pp. 208\u2013216. ACM, New York (2024)","DOI":"10.1145\/3666000.3669692"},{"key":"19_CR23","volume-title":"Differential Algebra","author":"JF Ritt","year":"1950","unstructured":"Ritt, J.F.: Differential Algebra, vol. 33. AMS, Providence (1950)"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Silva, S.R.X.D., Schnitman, L., Filho, V.C.: Analysis of computational efficiency for the solution of inverse kinematics problem of anthropomorphic robots using gr\u00f6bner bases theory. Int. J. Adv. Robot. Syst. 18(1), 1729881421989542 (2021)","DOI":"10.1177\/1729881421989542"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Sz\u00e1nt\u00f3, \u00c1.: Complexity of the Wu-Ritt decomposition. In: Proceedings of the Second International Symposium on Parallel Symbolic Computation, pp. 139\u2013149. ACM, New York (1997)","DOI":"10.1145\/266670.266716"},{"key":"19_CR26","unstructured":"Sz\u00e1nt\u00f3, \u00c1.: Computation with Polynomial Systems. Ph.D. thesis, Cornell University (1999)"},{"issue":"3","key":"19_CR27","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/jsco.1997.0177","volume":"25","author":"D Wang","year":"1998","unstructured":"Wang, D.: Decomposing polynomial systems into simple systems. J. Symb. Comput. 25(3), 295\u2013314 (1998)","journal-title":"J. Symb. Comput."},{"issue":"2","key":"19_CR28","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jsco.1999.0355","volume":"30","author":"D Wang","year":"2000","unstructured":"Wang, D.: Computing triangular systems and regular systems. J. Symb. Comput. 30(2), 221\u2013236 (2000)","journal-title":"J. Symb. Comput."},{"issue":"1","key":"19_CR29","first-page":"1","volume":"31","author":"WT Wu","year":"1986","unstructured":"Wu, W.T.: On zeros of algebraic equations: an application of Ritt principle. Kexue Tongbao (Chinese) 31(1), 1\u20135 (1986)","journal-title":"Kexue Tongbao (Chinese)"},{"key":"19_CR30","unstructured":"Yang, L., Zhang, J.: Searching dependency between algebraic equations: an algorithm applied to automated reasoning. In: Artificial Intelligence in Mathematics, pp. 147\u2013156. Clarendon Press, Oxford (1994)"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09645-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T20:06:57Z","timestamp":1761941217000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09645-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,1]]},"ISBN":["9783032096449","9783032096456"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09645-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,1]]},"assertion":[{"value":"1 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/casc-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}