{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:28:24Z","timestamp":1743114504376,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_51","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"681-693","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of the Positive Semidefinite Zero Forcing"],"prefix":"10.1007","author":[{"given":"Shaun","family":"Fallat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karen","family":"Meagher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"AIM Minimum Rank-Special Graphs Work Group: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428(7), 1628\u20131648 (2008)","DOI":"10.1016\/j.laa.2007.10.009"},{"key":"51_CR2","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1002\/jgt.21637","volume":"72","author":"F Barioli","year":"2013","unstructured":"Barioli, F., Barrett, W., Fallat, S., Hall, H.T., Hogben, L., Shader, B., van den Driessche, P., van der Holst, H.: Parameters related to tree-width, zero forcing, and maximum nullity of a graph. J. Graph Theory 72, 146\u2013177 (2013)","journal-title":"J. Graph Theory"},{"issue":"2","key":"51_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.laa.2010.03.008","volume":"433","author":"F Barioli","year":"2010","unstructured":"Barioli, F., Barrett, W., Fallat, S., Hall, H.T., Hogben, L., Shader, B., van den Driessche, P., van der Holst, H.: Zero forcing parameters and minimum rank problems. Linear Algebra Appl. 433(2), 401\u2013411 (2010)","journal-title":"Linear Algebra Appl."},{"key":"51_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D Bienstock","year":"1991","unstructured":"Bienstock, D., Seymour, P.: Monotonicity in graph searching. J. Algorithms 12, 239\u2013245 (1991)","journal-title":"J. Algorithms"},{"key":"51_CR5","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1137\/050629793","volume":"30","author":"M Booth","year":"2008","unstructured":"Booth, M., Hackney, P., Harris, B., Johnson, C.R., Lay, M., Mitchell, L.H., Narayan, S.K., Pascoe, A., Steinmetz, K., Sutton, B.D., Wang, W.: On the minimum rank among positive semidefinite matrices with a given graph. SIAM J. Matrix Anal. Appl. 30, 731\u2013740 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"10","key":"51_CR6","doi-asserted-by":"publisher","first-page":"100501","DOI":"10.1103\/PhysRevLett.99.100501","volume":"99","author":"D Burgarth","year":"2007","unstructured":"Burgarth, D., Giovannetti, V.: Full control by locally induced relaxation. Phys. Rev. Lett. 99(10), 100501 (2007)","journal-title":"Phys. Rev. Lett."},{"key":"51_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-540-68880-8_15","volume-title":"Algorithmic Aspects in Information and Management","author":"D Dyer","year":"2008","unstructured":"Dyer, D., Yang, B., Ya\u015far, \u00d6.: On the fast searching problem. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 143\u2013154. Springer, Heidelberg (2008)"},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"1862","DOI":"10.1016\/j.laa.2013.05.020","volume":"439","author":"J Ekstrand","year":"2013","unstructured":"Ekstrand, J., Erickson, C., Hall, H.T., Hay, D., Hogben, L., Johnson, R., Kingsley, N., Osborne, S., Peters, T., Roat, J., et al.: Positive semidefinite zero forcing. Linear Algebra Appl. 439, 1862\u20131874 (2013)","journal-title":"Linear Algebra Appl."},{"key":"51_CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.13001\/1081-3810.1506","volume":"23","author":"J Ekstrand","year":"2012","unstructured":"Ekstrand, J., Erickson, C., Hay, D., Hogben, L., Roat, J.: Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial $$2$$-trees. Electron. J. Linear Algebra 23, 79\u201397 (2012)","journal-title":"Electron. J. Linear Algebra"},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"L Kirousis","year":"1986","unstructured":"Kirousis, L., Papadimitriou, C.: Searching and pebbling. Theoret. Comput. Sci. 47, 205\u2013218 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The complexity of searching a graph. J. ACM 35, 18\u201344 (1988)","journal-title":"J. ACM"},{"key":"51_CR12","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s003730050068","volume":"15","author":"ER Scheinerman","year":"1999","unstructured":"Scheinerman, E.R., Trenk, A.N.: On the fractional intersection number of a graph. Graphs Combin. 15, 341\u2013351 (1999)","journal-title":"Graphs Combin."},{"issue":"7","key":"51_CR13","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2013.04.015","volume":"507","author":"B Yang","year":"2013","unstructured":"Yang, B.: Fast-mixed searching and related problems on graphs. Theoret. Comput. Sci. 507(7), 100\u2013113 (2013)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T09:12:06Z","timestamp":1674897126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}