{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:36Z","timestamp":1759637796891,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_52","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"629-639","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Positive Semidefinite Zero Forcing: Complexity and Lower Bounds"],"prefix":"10.1007","author":[{"given":"Boting","family":"Yang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"52_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":"52_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":"52_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":"52_CR4","first-page":"10","volume":"22","author":"F Barioli","year":"2011","unstructured":"Barioli, F., Fallat, S., Mitchell, L., Narayan, S.: Minimum semidefinite rank of outerplanar graphs and the tree cover number Electron. J. Linear Algebra 22, 10\u201321 (2011)","journal-title":"J. Linear Algebra"},{"key":"52_CR5","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":"52_CR6","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":"52_CR7","doi-asserted-by":"publisher","first-page":"100","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), 100\u2013501 (2007)","journal-title":"Phys. Rev. Lett."},{"key":"52_CR8","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":"52_CR9","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., Ross, A., Row, D., Warnberg, N., Young, M.: Positive semidefinite zero forcing. Linear Algebra Appl. 439, 1862\u20131874 (2013)","journal-title":"Linear Algebra Appl."},{"key":"52_CR10","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\u201387 (2012)","journal-title":"Electron. J. Linear Algebra"},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"Fallat, S., Meagher, K., Yang, B.: On the complexity of the positive semidefinite zero forcing number. Linear Algebra Appl. (accepted March 2015), doi:10.1016\/j.laa.2015.03.011","DOI":"10.1016\/j.laa.2015.03.011"},{"issue":"6","key":"52_CR12","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Efficient algorithms for graph manipulation. Communications of the ACM 16(6), 372\u2013378 (1973)","journal-title":"Communications of the ACM"},{"key":"52_CR13","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":"52_CR14","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0196-6774(02)00221-3","volume":"45","author":"J Kratochv\u00edl","year":"2002","unstructured":"Kratochv\u00edl, J., Tuza, Z.: On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45, 40\u201354 (2002)","journal-title":"J. Algorithms"},{"key":"52_CR15","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":"52_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.: Graph minors I: Excluding a forest. J. of Combinatorial Theory, Series B 35, 39\u201361 (1983)","journal-title":"J. of Combinatorial Theory, Series B"},{"key":"52_CR17","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N Robertson","year":"1984","unstructured":"Robertson, N., Seymour, N.: Graph minors III: Planar tree-width. J. of Combinatorial Theory, Series B 36, 49\u201364 (1984)","journal-title":"J. of Combinatorial Theory, Series B"},{"key":"52_CR18","doi-asserted-by":"crossref","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The Recognition of Series Parallel Digraphs. SIAM J. Comput. 11, 289\u2013313 (1982), and Proc. 11th ACM Symp. Theory of Computing, vol. 1-12 (1979)","DOI":"10.1137\/0211023"},{"key":"52_CR19","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall (2001)"},{"issue":"7","key":"52_CR20","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."},{"key":"52_CR21","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10878-006-9013-9","volume":"13","author":"B Yang","year":"2007","unstructured":"Yang, B.: Strong-mixed searching and pathwidth. J. of Combinatorial Optimization 13, 47\u201359 (2007)","journal-title":"J. of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T17:35:22Z","timestamp":1675272922000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}