{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T08:54:08Z","timestamp":1764060848752,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,23]],"date-time":"2019-01-23T00:00:00Z","timestamp":1548201600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,23]],"date-time":"2019-01-23T00:00:00Z","timestamp":1548201600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["1634550","1404864"],"award-info":[{"award-number":["1634550","1404864"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1720225"],"award-info":[{"award-number":["1720225"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Rice University Academy of Fellows"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10878-019-00380-7","type":"journal-article","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T14:51:22Z","timestamp":1548341482000},"page":"292-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Connected power domination in graphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Boris","family":"Brimkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derek","family":"Mikesell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Logan","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,23]]},"reference":[{"key":"380_CR1","unstructured":"Aazami A (2008) Hardness results and approximation algorithms for some problems on graphs. Ph.D. thesis, Ph.D. thesis. University of Waterloo"},{"issue":"4","key":"380_CR2","doi-asserted-by":"publisher","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(4):429\u2013456","journal-title":"J Comb Optim"},{"issue":"3","key":"380_CR3","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.1137\/06066672X","volume":"23","author":"A Aazami","year":"2009","unstructured":"Aazami A, Stilp K (2009) Approximation algorithms and hardness for domination with propagation. SIAM J Discrete Math 23(3):1382\u20131399","journal-title":"SIAM J Discrete Math"},{"issue":"7","key":"380_CR4","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1016\/j.laa.2007.10.009","volume":"428","author":"AIM Special Work Group","year":"2008","unstructured":"AIM Special Work Group (2008) Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl 428(7):1628\u20131648","journal-title":"Linear Algebra Appl"},{"key":"380_CR5","doi-asserted-by":"crossref","unstructured":"Akhlaghi S, Zhou N, Wu NE (2016) PMU placement for state estimation considering measurement redundancy and controlled islanding. In: Power and Energy Society General Meeting (PESGM), pp 1\u20135","DOI":"10.1109\/PESGM.2016.7741546"},{"issue":"2","key":"380_CR6","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1109\/TPWRD.2010.2090907","volume":"26","author":"F Aminifar","year":"2011","unstructured":"Aminifar F, Fotuhi-Firuzabad M, Shahidehpour M, Khodaei A (2011) Probabilistic multistage PMU placement in electric power systems. IEEE Trans Power Deliv 26(2):841\u2013849","journal-title":"IEEE Trans Power Deliv"},{"key":"380_CR7","doi-asserted-by":"crossref","unstructured":"Bader DA, Kappes A, Meyerhenke H, Sanders P, Schulz C, Wagner D (2014) Benchmarking for graph clustering and partitioning. In: Encyclopedia of social network analysis and mining. Springer, pp 73\u201382","DOI":"10.1007\/978-1-4614-6170-8_23"},{"issue":"2","key":"380_CR8","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/59.260810","volume":"8","author":"T Baldwin","year":"1993","unstructured":"Baldwin T, Mili L, Boisen M, 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"},{"key":"380_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.laa.2004.06.019","volume":"392","author":"F Barioli","year":"2004","unstructured":"Barioli F, Fallat S, Hogben L (2004) Computation of minimal rank and path cover number for certain graphs. Linear Algebra Appl 392:289\u2013303","journal-title":"Linear Algebra Appl"},{"key":"380_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.laa.2004.09.014","volume":"409","author":"F Barioli","year":"2005","unstructured":"Barioli F, Fallat S, Hogben L (2005) On the difference between the maximum multiplicity and path cover number for tree-like graphs. Linear Algebra Appl 409:13\u201331","journal-title":"Linear Algebra Appl"},{"issue":"2","key":"380_CR11","first-page":"221","volume":"70","author":"KF Benson","year":"2018","unstructured":"Benson KF, Ferrero D, Flagg M, Furst V, Hogben L, Vasilevska V, Wissman B (2018) Power domination and zero forcing for graph products. Aust J Comb 70(2):221\u2013235","journal-title":"Aust J Comb"},{"key":"380_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications, vol 290. Macmillan, London"},{"key":"380_CR13","doi-asserted-by":"crossref","unstructured":"Bozeman C, Brimkov B, Erickson C, Ferrero D, Flagg M, Hogben L (2018) Restricted power domination and zero forcing problems. J Comb Optim, in press","DOI":"10.1007\/s10878-018-0330-6"},{"key":"380_CR14","unstructured":"Brimkov B, Fast CC, Hicks IV (2018) Computational approaches for zero forcing and related problems. Eur J Oper Res, in press"},{"key":"380_CR15","unstructured":"Brimkov B, Fast CC, Hicks IV (2017) Graphs with extremal connected forcing numbers. arXiv:1701.08500"},{"key":"380_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.dam.2017.05.016","volume":"229","author":"B Brimkov","year":"2017","unstructured":"Brimkov B, Hicks IV (2017) Complexity and computation of connected zero forcing. Discrete Appl Math 229:31\u201345","journal-title":"Discrete Appl Math"},{"key":"380_CR17","unstructured":"Brueni DJ (1993) Minimal PMU placement for graph observability: a decomposition approach. Ph.D. thesis, Virginia Tech"},{"issue":"3","key":"380_CR18","doi-asserted-by":"publisher","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(3):744\u2013761","journal-title":"SIAM J Discrete Math"},{"issue":"10","key":"380_CR19","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"},{"key":"380_CR20","first-page":"207","volume":"16","author":"E Camby","year":"2014","unstructured":"Camby E, Cardinal J, Fiorini S, Schaudt O (2014) The price of connectivity for vertex cover. Discrete Math Theor Comput Sci 16:207\u2013223","journal-title":"Discrete Math Theor Comput Sci"},{"issue":"2","key":"380_CR21","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1137\/S0895480199353780","volume":"13","author":"Y Caro","year":"2000","unstructured":"Caro Y, West DB, Yuster R (2000) Connected domination and spanning trees with many leaves. SIAM J Discrete Math 13(2):202\u2013211","journal-title":"SIAM J Discrete Math"},{"issue":"12","key":"380_CR22","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1016\/j.dam.2012.03.007","volume":"160","author":"GJ Chang","year":"2012","unstructured":"Chang GJ, Dorbec P, Montassier M, Raspaud A (2012) Generalized power domination of graphs. Discrete Appl Math 160(12):1691\u20131698","journal-title":"Discrete Appl Math"},{"issue":"4","key":"380_CR23","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1007\/s10878-013-9688-7","volume":"30","author":"GJ Chang","year":"2015","unstructured":"Chang GJ, Roussel N (2015) On the $k$-power domination of hypergraphs. J Comb Optim 30(4):1095\u20131106","journal-title":"J Comb Optim"},{"issue":"18","key":"380_CR24","doi-asserted-by":"publisher","first-page":"2925","DOI":"10.1016\/j.dam.2013.06.023","volume":"161","author":"WJ Desormeaux","year":"2013","unstructured":"Desormeaux WJ, Haynes TW, Henning MA (2013) Bounds on the connected domination number of a graph. Discrete Appl Math 161(18):2925\u20132931","journal-title":"Discrete Appl Math"},{"issue":"1","key":"380_CR25","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M Desrochers","year":"1991","unstructured":"Desrochers M, Laporte G (1991) Improvements and extensions to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints. Oper Res Lett 10(1):27\u201336","journal-title":"Oper Res Lett"},{"key":"380_CR26","unstructured":"Dilkina BN, Gomes CP (2010) Solving connected subgraph problems in wildlife conservation. In: CPAIOR, vol 6140. Springer, pp 102\u2013116"},{"issue":"1","key":"380_CR27","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10440-014-9870-7","volume":"134","author":"P Dorbec","year":"2014","unstructured":"Dorbec P, Klav\u017ear S (2014) Generalized power domination: propagation radius and Sierpi\u0144ski graphs. Acta Appl Math 134(1):75\u201386","journal-title":"Acta Appl Math"},{"issue":"12","key":"380_CR28","doi-asserted-by":"publisher","first-page":"4352","DOI":"10.1016\/j.laa.2010.10.015","volume":"436","author":"CJ Edholm","year":"2012","unstructured":"Edholm CJ, Hogben L, LaGrange J, Row DD (2012) Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph. Linear Algebra Appl 436(12):4352\u20134372","journal-title":"Linear Algebra Appl"},{"key":"380_CR29","doi-asserted-by":"crossref","unstructured":"Fan N, Watson J-P (2012) Solving the connected dominating set problem and power dominating set problem by integer programming. In: International conference on combinatorial optimization and applications. Springer, pp 371\u2013383","DOI":"10.1007\/978-3-642-31770-5_33"},{"issue":"3","key":"380_CR30","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/s10878-016-0103-z","volume":"34","author":"D Ferrero","year":"2017","unstructured":"Ferrero D, Hogben L, Kenter FH, Young M (2017) 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":"2","key":"380_CR31","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00453-007-9145-z","volume":"52","author":"FV Fomin","year":"2008","unstructured":"Fomin FV, Grandoni F, Kratsch D (2008) Solving connected dominating set faster than $2^n$. Algorithmica 52(2):153\u2013166","journal-title":"Algorithmica"},{"key":"380_CR32","volume-title":"Computers and intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. W.H. Freeman & Co., San Francisco"},{"key":"380_CR33","doi-asserted-by":"crossref","unstructured":"Guo J, Niedermeier R, Raible D (2005) Improved algorithms and complexity results for power domination in graphs. In: FCT, vol 3623. Springer, pp 172\u2013184","DOI":"10.1007\/11537311_16"},{"issue":"4","key":"380_CR34","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":"11","key":"380_CR35","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"},{"issue":"2","key":"380_CR36","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/TPWRS.2013.2285578","volume":"29","author":"L Huang","year":"2014","unstructured":"Huang L, Sun Y, Xu J, Gao W, Zhang J, Wu Z (2014) Optimal PMU placement considering controlled islanding of power system. IEEE Trans Power Syst 29(2):742\u2013755","journal-title":"IEEE Trans Power Syst"},{"key":"380_CR37","unstructured":"IEEE reliability test data (2012). http:\/\/www.ee.washington.edu\/research\/pstca\/"},{"issue":"4","key":"380_CR38","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ipl.2006.01.007","volume":"98","author":"J Kneis","year":"2006","unstructured":"Kneis J, M\u00f6lle D, Richter S, Rossmanith P (2006) Parameterized power domination complexity. Inf Process Lett 98(4):145\u2013149","journal-title":"Inf Process Lett"},{"issue":"1","key":"380_CR39","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/TSG.2012.2228242","volume":"4","author":"Q Li","year":"2013","unstructured":"Li Q, Cui T, Weng Y, Negi R, Franchetti F, Ilic MD (2013) An information-theoretic approach to PMU placement in electric power systems. IEEE Trans Smart Grid 4(1):446\u2013456","journal-title":"IEEE Trans Smart Grid"},{"key":"380_CR40","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.amc.2016.12.004","volume":"301","author":"Y Li","year":"2017","unstructured":"Li Y, Yang Z, Wang W (2017) Complexity and algorithms for the connected vertex cover problem in 4-regular graphs. Appl Math Comput 301:107\u2013114","journal-title":"Appl Math Comput"},{"issue":"2","key":"380_CR41","doi-asserted-by":"publisher","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(2):725\u2013742","journal-title":"J Comb Optim"},{"key":"380_CR42","unstructured":"Liao C-S, Lee D-T (2005) Power domination problem in graphs. In: COCOON. Springer, pp 818\u2013828"},{"issue":"2","key":"380_CR43","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1109\/TPWRS.2011.2179816","volume":"27","author":"NM Manousakis","year":"2012","unstructured":"Manousakis NM, Korres GN, Georgilakis PS (2012) Taxonomy of PMU placement methodologies. IEEE Trans Power Syst 27(2):1070\u20131077","journal-title":"IEEE Trans Power Syst"},{"issue":"3","key":"380_CR44","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","volume":"10","author":"RK Martin","year":"1991","unstructured":"Martin RK (1991) Using separation algorithms to generate mixed integer model reformulations. Oper Res Lett 10(3):119\u2013128","journal-title":"Oper Res Lett"},{"key":"380_CR45","unstructured":"Mili L, Baldwin T, Phadke A (1991) Phasor measurements for voltage and transient stability monitoring and control. In: Workshop on application of advanced mathematics to power systems, San Francisco"},{"issue":"4","key":"380_CR46","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326\u2013329","journal-title":"J ACM"},{"key":"380_CR47","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0024-3795(95)00238-3","volume":"248","author":"PM Nylen","year":"1996","unstructured":"Nylen PM (1996) Minimum-rank matrices with prescribed graph. Linear Algebra Appl 248:303\u2013316","journal-title":"Linear Algebra Appl"},{"issue":"4","key":"380_CR48","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.ijepes.2005.05.005","volume":"28","author":"J Peng","year":"2006","unstructured":"Peng J, Sun Y, Wang H (2006) Optimal PMU placement for full network observability using Tabu search algorithm. Int J Electr Power Energy Syst 28(4):223\u2013231","journal-title":"Int J Electr Power Energy Syst"},{"issue":"12","key":"380_CR49","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1016\/j.dam.2009.01.017","volume":"158","author":"FP Quint\u00e3o","year":"2010","unstructured":"Quint\u00e3o FP, da Cunha AS, Mateus GR, Lucena A (2010) The k-cardinality tree problem: reformulations and Lagrangian relaxation. Discrete Appl Math 158(12):1305\u20131314","journal-title":"Discrete Appl Math"},{"issue":"3","key":"380_CR50","doi-asserted-by":"publisher","first-page":"277","DOI":"10.2140\/involve.2011.4.277","volume":"4","author":"D Row","year":"2012","unstructured":"Row D (2012) Zero forcing number, path cover number, and maximum nullity of cacti. Involve 4(3):277\u2013291","journal-title":"Involve"},{"issue":"6","key":"380_CR51","first-page":"607","volume":"13","author":"E Sampathkumar","year":"1979","unstructured":"Sampathkumar E, Walikar HB (1979) The connected domination number of a graph. J Math Phys Sci 13(6):607\u2013613","journal-title":"J Math Phys Sci"},{"issue":"2","key":"380_CR52","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1049\/iet-gtd.2009.0709","volume":"5","author":"R Sodhi","year":"2011","unstructured":"Sodhi R, Srivastava S, Singh S (2011) Multi-criteria decision-making approach for multi-stage optimal placement of phasor measurement units. IET Gener Transm Distrib 5(2):181\u2013190","journal-title":"IET Gener Transm Distrib"},{"issue":"6","key":"380_CR53","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0020-0190(74)90003-9","volume":"2","author":"RE Tarjan","year":"1974","unstructured":"Tarjan RE (1974) A note on finding the bridges of a graph. Inf Process Lett 2(6):160\u2013161","journal-title":"Inf Process Lett"},{"key":"380_CR54","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-mixed 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-019-00380-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00380-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00380-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T22:04:49Z","timestamp":1662847489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00380-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,23]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["380"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00380-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,1,23]]},"assertion":[{"value":"23 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}