{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:13:16Z","timestamp":1743012796189,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49193-1_27","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"353-365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Systems of\u00a0Linear Equations Through Zero Forcing Set"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-8063-7930","authenticated-orcid":false,"given":"Jianbo","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4417-3299","authenticated-orcid":false,"given":"Chao","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6214-9682","authenticated-orcid":false,"given":"Siyun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","unstructured":"AIM Minimum Rank \u2013 Special Graphs Work Group: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428(7), 1628\u20131648 (2008). https:\/\/doi.org\/10.1016\/j.laa.2007.10.009","DOI":"10.1016\/j.laa.2007.10.009"},{"key":"27_CR2","doi-asserted-by":"publisher","unstructured":"Alman, J., Williams, V.V.: A refined laser method and faster matrix multiplication. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 522\u2013539 (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.32. https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611976465.32","DOI":"10.1137\/1.9781611976465.32"},{"issue":"4","key":"27_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2508028.2505989","volume":"60","author":"N Alon","year":"2013","unstructured":"Alon, N., Yuster, R.: Matrix sparsification and nested dissection over arbitrary fields. J. ACM 60(4), 1\u201318 (2013). https:\/\/doi.org\/10.1145\/2508028.2505989","journal-title":"J. ACM"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"126","DOI":"10.13001\/1081-3810.1300","volume":"18","author":"F Barioli","year":"2009","unstructured":"Barioli, F., et al.: On the minimum rank of not necessarily symmetric matrices: a preliminary study. Electron. J. Linear Algebra 18, 126\u2013145 (2009). https:\/\/doi.org\/10.13001\/1081-3810.1300","journal-title":"Electron. J. Linear Algebra"},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00591-021-00297-5","volume":"68","author":"A Berman","year":"2021","unstructured":"Berman, A., Borer, F., Hungerb\u00fchler, N.: Lights Out on graphs. Math. Semesterber. 68(2), 237\u2013255 (2021). https:\/\/doi.org\/10.1007\/s00591-021-00297-5","journal-title":"Math. Semesterber."},{"key":"27_CR6","doi-asserted-by":"publisher","unstructured":"Brimkov, B., Fast, C.C., Hicks, I.V.: Computational approaches for zero forcing and related problems. Eur. J. Oper. Res. 273(3), 889\u2013903 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.09.03. https:\/\/ideas.repec.org\/a\/eee\/ejores\/v273y2019i3p889-903.html","DOI":"10.1016\/j.ejor.2018.09.03"},{"key":"27_CR7","doi-asserted-by":"publisher","unstructured":"Brimkov, B., Mikesell, D., Hicks, I.V.: Improved computational approaches and heuristics for zero forcing. INFORMS J. Comput. 33(4), 1384\u20131399 (2021). https:\/\/doi.org\/10.1287\/ijoc.2020.1032. https:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/ijoc.2020.1032","DOI":"10.1287\/ijoc.2020.1032"},{"key":"27_CR8","doi-asserted-by":"publisher","unstructured":"Burgarth, D., Giovannetti, V.: Full control by locally induced relaxation. Phys. Rev. Lett. 99, 100501 (2007). https:\/\/doi.org\/10.1103\/PhysRevLett.99.100501. https:\/\/link.aps.org\/doi\/10.1103\/PhysRevLett.99.100501","DOI":"10.1103\/PhysRevLett.99.100501"},{"key":"27_CR9","doi-asserted-by":"publisher","unstructured":"Dean, N., Ilic, A., Ramirez, I., Shen, J., Tian, K.: On the power dominating sets of hypercubes. In: 2011 14th IEEE International Conference on Computational Science and Engineering, pp. 488\u2013491 (2011). https:\/\/doi.org\/10.1109\/CSE.2011.89","DOI":"10.1109\/CSE.2011.89"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-40273-9_13","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms","author":"R Fleischer","year":"2013","unstructured":"Fleischer, R., Yu, J.: A survey of the game \u201clights out!\u2019\u2019. In: Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.) Space-Efficient Data Structures, Streams, and Algorithms. LNCS, vol. 8066, pp. 176\u2013198. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40273-9_13"},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Pilipczuk, M., Saurabh, S., Wrochna, M.: Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. In: Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1419\u20131432 (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.92. https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611974782.92","DOI":"10.1137\/1.9781611974782.92"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3186898","volume":"14","author":"FV Fomin","year":"2018","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Pilipczuk, M., Wrochna, M.: Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. ACM Trans. Algorithms 14(3), 1\u201345 (2018). https:\/\/doi.org\/10.1145\/3186898","journal-title":"ACM Trans. Algorithms"},{"key":"27_CR13","series-title":"Johns Hopkins Studies in the Mathematical Sciences","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences, 4th edn. Johns Hopkins University Press, Baltimore (2013)","edition":"4"},{"issue":"8","key":"27_CR14","doi-asserted-by":"publisher","first-page":"1961","DOI":"10.1016\/j.laa.2009.05.003","volume":"432","author":"L Hogben","year":"2010","unstructured":"Hogben, L.: Minimum rank problems. Linear Algebra Appl. 432(8), 1961\u20131974 (2010). https:\/\/doi.org\/10.1016\/j.laa.2009.05.003","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"27_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0196-6774(82)90007-4","volume":"3","author":"OH Ibarra","year":"1982","unstructured":"Ibarra, O.H., Moran, S., Hui, R.: A generalization of the fast LUP matrix decomposition algorithm and applications. J. Algorithms 3(1), 45\u201356 (1982). https:\/\/doi.org\/10.1016\/0196-6774(82)90007-4","journal-title":"J. Algorithms"},{"key":"27_CR16","unstructured":"Jeannerod, C.P.: LSP matrix decomposition revisited. Technical report, 2006-28, \u00c9cole Normale Sup\u00e9rieure de Lyon (2006)"},{"key":"27_CR17","doi-asserted-by":"publisher","unstructured":"Kenter, F.H., Lin, J.C.H.: On the error of a priori sampling: zero forcing sets and propagation time. Linear Algebra Appl. 576, 124\u2013141 (2019). https:\/\/doi.org\/10.1016\/j.laa.2018.03.031. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0024379518301411","DOI":"10.1016\/j.laa.2018.03.031"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"126","DOI":"10.4169\/math.mag.90.2.126","volume":"90","author":"CD Leach","year":"2017","unstructured":"Leach, C.D.: Chasing the lights in lights out. Math. Mag. 90(2), 126\u2013133 (2017). https:\/\/doi.org\/10.4169\/math.mag.90.2.126","journal-title":"Math. Mag."},{"key":"27_CR19","doi-asserted-by":"publisher","unstructured":"Lipton, R.J., Rose, D.J., Tarjan, R.E.: Generalized nested dissection. SIAM J. Numer. Anal. 16(2), 346\u2013358 (1979). https:\/\/doi.org\/10.1137\/0716027. http:\/\/epubs.siam.org\/doi\/10.1137\/0716027","DOI":"10.1137\/0716027"},{"issue":"48","key":"27_CR20","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/41\/48\/482002","volume":"41","author":"S Severini","year":"2008","unstructured":"Severini, S.: Nondiscriminatory propagation on trees. J. Phys. A: Math. Theor. 41(48), 482002 (2008). https:\/\/doi.org\/10.1088\/1751-8113\/41\/48\/482002","journal-title":"J. Phys. A: Math. Theor."},{"key":"27_CR21","doi-asserted-by":"publisher","unstructured":"Trefois, M., Delvenne, J.C.: Zero forcing number, constrained matchings and strong structural controllability. Linear Algebra Appl. 484, 199\u2013218 (2015). https:\/\/doi.org\/10.1016\/j.laa.2015.06.025. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S002437951500378X","DOI":"10.1016\/j.laa.2015.06.025"},{"key":"27_CR22","unstructured":"Wang (axpokl), Z.: \n                  \n                 flip game \n                  \n                $$O(n^3)$$\n                  \n                 (2018). https:\/\/zhuanlan.zhihu.com\/p\/53646257"},{"key":"27_CR23","doi-asserted-by":"publisher","unstructured":"Yang, B.: Fast-mixed searching and related problems on graphs. Theor. Comput. Sci. 507, 100\u2013113 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.04.015. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397513002995. Combinatorial Optimization and Applications","DOI":"10.1016\/j.tcs.2013.04.015"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49193-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:07:15Z","timestamp":1702026435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}