{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T05:39:02Z","timestamp":1771306742353,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,12,20]],"date-time":"2016-12-20T00:00:00Z","timestamp":1482192000000},"content-version":"unspecified","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":[[2017,10]]},"DOI":"10.1007\/s10878-016-0103-z","type":"journal-article","created":{"date-parts":[[2016,12,20]],"date-time":"2016-12-20T15:37:15Z","timestamp":1482248235000},"page":"736-741","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Note on power propagation time and lower bounds for the power domination number"],"prefix":"10.1007","volume":"34","author":[{"given":"Daniela","family":"Ferrero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1673-3789","authenticated-orcid":false,"given":"Leslie","family":"Hogben","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franklin H. J.","family":"Kenter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,20]]},"reference":[{"key":"103_CR1","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10878-008-9176-7","volume":"19","author":"A Aazami","year":"2010","unstructured":"Aazami A (2010) Domination in graphs with bounded propagation: algorithms, formulations and hardness results. J Comb Optim 19:429\u2013456","journal-title":"J Comb Optim"},{"key":"103_CR2","unstructured":"Aazami A (2008) Hardness results and approximation algorithms for some problems on graphs. PhD Thesis, University of Waterloo. http:\/\/hdl.handle.net\/10012\/4147"},{"key":"103_CR3","doi-asserted-by":"crossref","unstructured":"AIM Minimum Rank \u2013 Special Graphs Work Group, Barioli F, Barrett W, Butler S, Cioaba 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, Vander Meulen K, Wehe AW (2008) Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl 428:1628\u20131648","DOI":"10.1016\/j.laa.2007.10.009"},{"key":"103_CR4","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1109\/59.260810","volume":"8","author":"TL Baldwin","year":"1993","unstructured":"Baldwin TL, Mili L, Boisen MB Jr, Adapa R (1993) Power system observability with minimal phasor measurement placement. IEEE Trans Power Syst 8:707\u2013715","journal-title":"IEEE Trans Power Syst"},{"key":"103_CR5","unstructured":"Benson KF, Ferrero D, Flagg M, Furst V, Hogben L, Vasilevska V, Wissman B Power domination and zero forcing. Under review. arxiv:1510.02421"},{"key":"103_CR6","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/S0895480103432556","volume":"19","author":"DJ Brueni","year":"2005","unstructured":"Brueni DJ, Heath LS (2005) The PMU placement problem. SIAM J Discrete Math 19:744\u2013761","journal-title":"SIAM J Discrete Math"},{"key":"103_CR7","doi-asserted-by":"crossref","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 PRL 99:100501","journal-title":"Phys Rev Lett PRL"},{"key":"103_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s00453-007-9147-x","volume":"52","author":"J Guo","year":"2008","unstructured":"Guo J, Niedermeier R, Raible D (2008) Improved algorithms and complexity results for power domination in graphs. Algorithmica 52:177\u2013202","journal-title":"Algorithmica"},{"key":"103_CR9","doi-asserted-by":"crossref","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:519\u2013529","journal-title":"SIAM J Discrete Math"},{"key":"103_CR10","doi-asserted-by":"crossref","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:1994\u20132005","journal-title":"Discrete Appl Math"},{"key":"103_CR11","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1007\/s10878-014-9785-2","volume":"31","author":"C-S Liao","year":"2016","unstructured":"Liao C-S (2016) Power domination with bounded time constraints. J Comb Optim 31:725\u2013742","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0103-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0103-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0103-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T15:47:33Z","timestamp":1568648853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0103-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,20]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["103"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0103-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,20]]}}}