{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T22:44:40Z","timestamp":1775947480456,"version":"3.50.1"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"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,5]]},"DOI":"10.1016\/j.tcs.2026.115903","type":"journal-article","created":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T00:13:51Z","timestamp":1774052031000},"page":"115903","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Throttling for metric dimension and its variants"],"prefix":"10.1016","volume":"1073","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5191-4062","authenticated-orcid":false,"given":"Boris","family":"Brimkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Diao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7148-5947","authenticated-orcid":false,"given":"Jesse","family":"Geneson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4489-8564","authenticated-orcid":false,"given":"Carolyn","family":"Reinhart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1328-8149","authenticated-orcid":false,"given":"Shen-Fu","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1517-7325","authenticated-orcid":false,"given":"Kyle","family":"Worley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115903_bib0001","doi-asserted-by":"crossref","first-page":"2457","DOI":"10.1016\/j.laa.2009.10.001","article-title":"Minimum rank of skewsymmetric matrices described by a graph","volume":"432","author":"Allison","year":"2010","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.tcs.2026.115903_bib0002","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.laa.2010.03.008","article-title":"Zero forcing parameters and minimum rank problems","volume":"433","author":"Barioli","year":"2017","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"10.1016\/j.tcs.2026.115903_bib0003","doi-asserted-by":"crossref","DOI":"10.26493\/1855-3974.2496.07a","article-title":"The adjacency dimension of graphs","volume":"22","author":"Bermudo","year":"2022","journal-title":"Ars Math. Contemp."},{"key":"10.1016\/j.tcs.2026.115903_bib0004","first-page":"79","article-title":"Optimizing the trade-off between number of cops and capture time in cops and robbers","volume":"13","author":"Bonato","year":"2022","journal-title":"J. Comb."},{"key":"10.1016\/j.tcs.2026.115903_bib0005","doi-asserted-by":"crossref","first-page":"2418","DOI":"10.1016\/j.disc.2018.05.017","article-title":"Throttling for the game of cops and robbers on graphs","volume":"341","author":"Breen","year":"2018","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2026.115903_bib0006","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.tcs.2019.06.008","article-title":"Power domination throttling","volume":"795","author":"Brimkov","year":"2019","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115903_bib0007","first-page":"65","article-title":"Throttling zero forcing propagation speed on graphs","volume":"57","author":"Butler","year":"2013","journal-title":"Australas. J. Combin."},{"key":"10.1016\/j.tcs.2026.115903_bib0008","first-page":"361","article-title":"The damage throttling number of a graph","volume":"80","author":"Carlson","year":"2021","journal-title":"Australas. J. Combin."},{"key":"10.1016\/j.tcs.2026.115903_bib0009","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.dam.2018.06.017","article-title":"Throttling positive semidefinite zero forcing propagation time on graphs","volume":"254","author":"Carlson","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115903_bib0010","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","article-title":"Resolvability in graphs and the metric dimension of a graph","volume":"105","author":"Chartrand","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115903_bib0011","first-page":"177","article-title":"Skew throttling","volume":"78","author":"Curl","year":"2020","journal-title":"Australas. J. Combin."},{"key":"10.1016\/j.tcs.2026.115903_bib0012","doi-asserted-by":"crossref","first-page":"4275","DOI":"10.2298\/FIL2113275M","article-title":"Some new general lower bounds for mixed metric dimension of graphs","volume":"35.13","author":"Danas","year":"2021","journal-title":"Filomat"},{"key":"10.1016\/j.tcs.2026.115903_bib0013","unstructured":"P. Diao, J. Geneson, ILP for metric dimension throttling, https:\/\/github.com\/jgeneson\/metric-dimension-throttling."},{"key":"10.1016\/j.tcs.2026.115903_bib0014","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.dam.2022.04.021","article-title":"Truncated metric dimension for finite graphs","volume":"320","author":"Frongillo","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115903_bib0015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2020.03.001","article-title":"Metric dimension and pattern avoidance in graphs","volume":"284","author":"Geneson","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115903_bib0016","unstructured":"J. Geneson, Throttling numbers for adversaries on connected graphs, 2019, arXiv: 1906.07178."},{"key":"10.1016\/j.tcs.2026.115903_bib0017","first-page":"397","article-title":"Expected propagation time for probabilistic zero forcing","volume":"83","author":"Geneson","year":"2022","journal-title":"Australas. J. Combin."},{"key":"10.1016\/j.tcs.2026.115903_bib0018","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.dam.2021.11.015","article-title":"Extremal results for graphs of bounded metric dimension","volume":"309","author":"Geneson","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115903_bib0019","unstructured":"J. Geneson, C. Quines, E. Slettnes, S. Tsai, Expected capture time and throttling number for cop versus gambler, 2019, arXiv: 1902.05860."},{"key":"10.1016\/j.tcs.2026.115903_bib0020","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.dam.2026.01.009","article-title":"Fault tolerance for metric dimension and its variants","volume":"383","author":"Geneson","year":"2026","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115903_bib0021","first-page":"191","article-title":"The metric dimension of a graph","volume":"2","author":"Harary","year":"1976","journal-title":"Ars Combin."},{"key":"10.1016\/j.tcs.2026.115903_bib0022","doi-asserted-by":"crossref","DOI":"10.37236\/302","article-title":"Extremal graph theory for metric dimension and diameter","volume":"17","author":"Hernando","year":"2010","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.tcs.2026.115903_bib0023","doi-asserted-by":"crossref","first-page":"3349","DOI":"10.1016\/j.disc.2012.07.025","article-title":"The metric dimension of the lexicographic product of graphs","volume":"312","author":"Jannesari","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2026.115903_bib0024","first-page":"9","article-title":"Probabilistic zero forcing in graphs","volume":"67","author":"Kang","year":"2013","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/j.tcs.2026.115903_bib0025","first-page":"429","article-title":"Mixed metric dimension of graphs","volume":"314","author":"Kelenc","year":"2017","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.tcs.2026.115903_bib0026","article-title":"On metric dimensions of hypercubes","volume":"23","author":"Kelenc","year":"2023","journal-title":"Ars Math. Contemp."},{"key":"10.1016\/j.tcs.2026.115903_bib0027","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.dam.2018.05.052","article-title":"Uniquely identifying the edges of a graph: the edge metric dimension","volume":"251","author":"Kelenc","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115903_bib0028","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","article-title":"Landmarks in graphs","volume":"70","author":"Khuller","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115903_bib0029","unstructured":"D. Kuziak, I.G. Yero, Metric dimension related parameters in graphs: a survey on combinatorial, computational and applied results, 2021, arXiv: 2107.04877."},{"key":"10.1016\/j.tcs.2026.115903_bib0030","first-page":"283","article-title":"The metric dimension of a complete n-partite graph and its cartesian product with a path","volume":"71","author":"Saputro","year":"2009","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/j.tcs.2026.115903_bib0031","article-title":"Extremal mixed metric dimension with respect to the cyclomatic number","volume":"404","author":"Sedlar","year":"2021","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.tcs.2026.115903_bib0032","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2021.05.004","article-title":"Mixed metric dimension of graphs with edge disjoint cycles","volume":"300","author":"Sedlar","year":"2021","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115903_bib0033","first-page":"549","article-title":"Leaves of trees","volume":"14","author":"Slater","year":"1975","journal-title":"Congr. Numer."},{"key":"10.1016\/j.tcs.2026.115903_bib0034","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1137\/21M1409512","article-title":"Getting the lay of the land in discrete space: a survey of metric dimension and its applications","volume":"65","author":"Tillquist","year":"2023","journal-title":"SIAM Rev."},{"key":"10.1016\/j.tcs.2026.115903_bib0035","doi-asserted-by":"crossref","first-page":"4459","DOI":"10.3934\/math.2020286","article-title":"On the edge metric dimension of graphs","volume":"5","author":"Wei","year":"2020","journal-title":"AIMS Math."},{"key":"10.1016\/j.tcs.2026.115903_bib0036","series-title":"Introduction to Graph Theory","author":"West","year":"2001"},{"key":"10.1016\/j.tcs.2026.115903_bib0037","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.dam.2018.08.031","article-title":"On graphs with the maximum edge metric dimension","volume":"257","author":"Zhu","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115903_bib0038","doi-asserted-by":"crossref","first-page":"589","DOI":"10.7151\/dmgt.2210","article-title":"Asymptotic behavior of the edge metric dimension of the random graph","volume":"41","author":"Zubrilina","year":"2021","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.tcs.2026.115903_bib0039","doi-asserted-by":"crossref","first-page":"2083","DOI":"10.1016\/j.disc.2018.04.010","article-title":"On the edge dimension of a graph","volume":"341","author":"Zubrilina","year":"2018","journal-title":"Discrete Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001623?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001623?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T22:03:13Z","timestamp":1775944993000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":39,"alternative-id":["S0304397526001623"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115903","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Throttling for metric dimension and its variants","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115903","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":"115903"}}