{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T05:42:40Z","timestamp":1776577360593,"version":"3.51.2"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.tcs.2026.115902","type":"journal-article","created":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T17:22:28Z","timestamp":1773854548000},"page":"115902","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Optimally reconnecting graphs against an edge-destroying adversary"],"prefix":"10.1016","volume":"1074","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5415-3617","authenticated-orcid":false,"given":"Daniel C.","family":"McDonald","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.tcs.2026.115902_bib0001","first-page":"57","volume":"6","author":"Jarnik","year":"1930","journal-title":"O jistem problemu minimalnim [About a certain minimal problem]"},{"issue":"6","key":"10.1016\/j.tcs.2026.115902_bib0002","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"10.1016\/j.tcs.2026.115902_bib0003","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/j.tcs.2026.115902_bib0004","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0167-5060(08)70335-2","article-title":"Biased positional games","volume":"2","author":"Chvatal","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.tcs.2026.115902_bib0005","series-title":"Positional Games. Oberwolfach Seminars","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-0825-5_2","article-title":"Maker-Breaker Games","volume":"vol 44","author":"Hefetz","year":"2014"},{"key":"10.1016\/j.tcs.2026.115902_bib0006","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/0112059","article-title":"A solution of the Shannon switching game","volume":"12","author":"Lehman","year":"1964","journal-title":"J. Soc. Indust. Appl. Math."},{"issue":"3","key":"10.1016\/j.tcs.2026.115902_bib0007","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1137\/140976054","article-title":"Building spanning trees quickly in Maker-breaker games","volume":"29","author":"Clemens","year":"2015","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"10.1016\/j.tcs.2026.115902_bib0008","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1002\/jgt.22072","article-title":"Efficient winning strategies in random-turn Maker-breaker games","volume":"85","author":"Ferber","year":"2017","journal-title":"J. Graph. Theory"},{"issue":"4","key":"10.1016\/j.tcs.2026.115902_bib0009","doi-asserted-by":"crossref","DOI":"10.37236\/5032","article-title":"Random-Player Maker-Breaker games","volume":"22","author":"Krivelevich","year":"2015","journal-title":"Electron. J. Combin"},{"key":"10.1016\/j.tcs.2026.115902_bib0010","series-title":"Handbook of Combinatorial Optimization","article-title":"Modern network interdiction problems and algorithms","author":"Smith","year":"2013"},{"key":"10.1016\/j.tcs.2026.115902_bib0011","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.3982\/TE5122","article-title":"Attack and interception in networks","volume":"18","author":"Bloch","year":"2023","journal-title":"Theor. Econ."},{"key":"10.1016\/j.tcs.2026.115902_bib0012","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.dam.2023.12.009","article-title":"Cops and Robber on butterflies, grids, and AT-free graphs","volume":"345","author":"Akhtar","year":"2024","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.tcs.2026.115902_bib0013","article-title":"On the cop number of string graphs","volume":"32","author":"Das","year":"2025","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.tcs.2026.115902_bib0014","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.tcs.2012.05.041","article-title":"Revolutionaries and spies: spy-good and spy-bad graphs","volume":"463","author":"Butterfield","year":"2012","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2026.115902_bib0015","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/18M1201846","article-title":"A polynomial-time approximation algorithm for all-terminal network reliability","volume":"48","author":"Guo","year":"2019","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001611?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001611?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T05:06:30Z","timestamp":1776575190000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":15,"alternative-id":["S0304397526001611"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115902","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimally reconnecting graphs against an edge-destroying adversary","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115902","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115902"}}