{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:40Z","timestamp":1740122380331,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T00:00:00Z","timestamp":1533772800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10878-018-0335-1","type":"journal-article","created":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T06:15:19Z","timestamp":1533795319000},"page":"970-988","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Minimum rank and zero forcing number for butterfly networks"],"prefix":"10.1007","volume":"37","author":[{"given":"Daniela","family":"Ferrero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyriac","family":"Grigorious","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8444-6848","authenticated-orcid":false,"given":"Thomas","family":"Kalinowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Ryan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudeep","family":"Stephen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"AIM Minimum Rank\u2014Special Graphs Work Group, Barioli F, Barrett W, Butle S, Cioab\u0103 SM, Cvetkovi\u0107 D, Fallat SM, Godsil C, Haemers W, Hogben L, Mikkelson R, Narayan S, Pryporova O, Sciriha I, So W, Stevanovi\u0107 D, van der Holst H, Van der Meulen K, Wangsness A (2008) Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl 428(7):1628\u20131648","key":"335_CR1","DOI":"10.1016\/j.laa.2007.10.009"},{"issue":"2","key":"335_CR2","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/59.260810","volume":"8","author":"TL Baldwin","year":"1993","unstructured":"Baldwin TL, Mili L, Boisen MB, Adapa R (1993) Power system observability with minimal phasor measurement placement. IEEE Trans Power Syst 8(2):707\u2013715","journal-title":"IEEE Trans Power Syst"},{"issue":"2","key":"335_CR3","first-page":"221","volume":"70","author":"KF Benson","year":"2017","unstructured":"Benson KF, Ferrero D, Flagg M, Furst V, Hogben L, Vasilevska V, Wissman B (2017) Zero forcing and power domination for graph products. Australas J Comb 70(2):221\u2013235","journal-title":"Australas J Comb"},{"key":"335_CR4","first-page":"33","volume-title":"Reliability of computer and communication network. DIMACS series in discrete mathematics and theoretical computer science","author":"D Bienstock","year":"1991","unstructured":"Bienstock D (1991) Graph searching, path-width, tree-width and related problems (a survey). In: Roberts FS, Hwang FK, Monma CL (eds) Reliability of computer and communication network. DIMACS series in discrete mathematics and theoretical computer science, vol 5. American Mathematical Society, Providence, pp 33\u201349"},{"issue":"2","key":"335_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 (1991) Monotonicity in graph searching. J Algorithms 12(2):239\u2013245","journal-title":"J Algorithms"},{"issue":"10","key":"335_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 (2007) Full control by locally induced relaxation. Phys Rev Lett 99(10):100501","journal-title":"Phys Rev Lett"},{"issue":"1\u20132","key":"335_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(96)00177-6","volume":"172","author":"ND Dendris","year":"1997","unstructured":"Dendris ND, Kirousis LM, Thilikos DM (1997) Fugitive-search games on graphs and related parameters. Theor Comput Sci 172(1\u20132):233\u2013254","journal-title":"Theor Comput Sci"},{"issue":"2","key":"335_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/net.20095","volume":"47","author":"S Dobrev","year":"2006","unstructured":"Dobrev S, Flocchini P, Kr\u00e1lovi\u010d R, Ru\u017ei\u010dka P, Prencipe G, Santoro N (2006) Black hole search in common interconnection networks. Networks 47(2):61\u201371","journal-title":"Networks"},{"key":"335_CR9","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":"On the fast searching problem, algorithmic aspects in information and management","author":"D Dyer","year":"2008","unstructured":"Dyer D, Yang B, Ya\u015far \u00d6 (2008) On the fast searching problem, algorithmic aspects in information and management. Lecture notes in computer science. Springer, Berlin, pp 143\u2013154"},{"issue":"2\u20133","key":"335_CR10","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.laa.2007.05.036","volume":"426","author":"SM Fallat","year":"2007","unstructured":"Fallat SM, Hogben L (2007) The minimum rank of symmetric matrices described by a graph: a survey. Linear Algebra Appl 426(2\u20133):558\u2013582","journal-title":"Linear Algebra Appl"},{"doi-asserted-by":"crossref","unstructured":"Fazel M, Hindi H, Boyd S (2004) Rank minimization and applications in system theory. In: Proceedings of the 2004 American control conference, vol\u00a04. IEEE, pp\u00a03273\u20133278","key":"335_CR11","DOI":"10.23919\/ACC.2004.1384521"},{"issue":"3","key":"335_CR12","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/s10878-016-0103-z","volume":"34","author":"D Ferrero","year":"2016","unstructured":"Ferrero D, Hogben L, Kenter FHJ, Young M (2016) Note on power propagation time and lower bounds for the power domination number. J Comb Optim 34(3):736\u2013741","journal-title":"J Comb Optim"},{"issue":"4","key":"335_CR13","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/S0895480100375831","volume":"15","author":"TW Haynes","year":"2002","unstructured":"Haynes TW, Hedetniemi SM, Hedetniemi ST, Henning MA (2002) Domination in graphs applied to electric power networks. SIAM J Discrete Math 15(4):519\u2013529","journal-title":"SIAM J Discrete Math"},{"issue":"13\u201314","key":"335_CR14","doi-asserted-by":"publisher","first-page":"1994","DOI":"10.1016\/j.dam.2012.04.003","volume":"160","author":"L Hogben","year":"2012","unstructured":"Hogben L, Huynh M, Kingsley N, Meyer S, Walker S, Young M (2012) Propagation time for zero forcing on a graph. Discrete Appl Math 160(13\u201314):1994\u20132005","journal-title":"Discrete Appl Math"},{"unstructured":"Hogben L, Barrett W, Grout J, van\u00a0der Holst H, Rasmussen K, Smith A (2016) AIM minimum rank graph catalog. \n                              http:\/\/admin.aimath.org\/resources\/graph-invariants\/minimumrankoffamilies\/#\/cuig","key":"335_CR15"},{"issue":"11","key":"335_CR16","doi-asserted-by":"publisher","first-page":"2961","DOI":"10.1016\/j.laa.2010.01.001","volume":"432","author":"L-H Huang","year":"2010","unstructured":"Huang L-H, Chang GJ, Yeh H-G (2010) On minimum rank and zero forcing sets of a graph. Linear Algebra Appl 432(11):2961\u20132973","journal-title":"Linear Algebra Appl"},{"unstructured":"Kirousis Lefteris\u00a0M, Kranakis E, Krizanc D, Stamatiou YC (2000) Locating information with uncertainty in fully interconnected networks. In: International symposium on distributed computing, lecture notes in computer science, vol 1914. Springer, Berlin, pp\u00a0283\u2013296","key":"335_CR17"},{"issue":"48","key":"335_CR18","doi-asserted-by":"publisher","first-page":"482002","DOI":"10.1088\/1751-8113\/41\/48\/482002","volume":"41","author":"S Severini","year":"2008","unstructured":"Severini S (2008) Nondiscriminatory propagation on trees. J Phys A Math Theor 41(48):482002","journal-title":"J Phys A Math Theor"},{"key":"335_CR19","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 (2013) Fast\u2013mixed searching and related problems on graphs. Theor Comput Sci 507:100\u2013113","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0335-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0335-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0335-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T19:17:58Z","timestamp":1565291878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0335-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,9]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["335"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0335-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,8,9]]},"assertion":[{"value":"9 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}