{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T09:10:04Z","timestamp":1778490604751,"version":"3.51.4"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004586","name":"Carlos Chagas Filho Foundation for Research Support of Rio de Janeiro State","doi-asserted-by":"publisher","award":["JCNE E-26\/201.372\/2022"],"award-info":[{"award-number":["JCNE E-26\/201.372\/2022"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004586","name":"Carlos Chagas Filho Foundation for Research Support of Rio de Janeiro State","doi-asserted-by":"publisher","award":["JCNE-E-26\/204.301\/2025"],"award-info":[{"award-number":["JCNE-E-26\/204.301\/2025"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["PQ 307666\/2025-5"],"award-info":[{"award-number":["PQ 307666\/2025-5"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["Universal 406173\/2021-4"],"award-info":[{"award-number":["Universal 406173\/2021-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.dam.2026.03.028","type":"journal-article","created":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T21:58:42Z","timestamp":1774648722000},"page":"34-45","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Tree t-spanners for edge adjacency distances"],"prefix":"10.1016","volume":"389","author":[{"given":"Fernanda","family":"Couto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3797-6053","authenticated-orcid":false,"given":"Lu\u00eds","family":"Cunha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Posner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.03.028_b1","series-title":"Foundations of Computer Science, 27th Annual Symposium on","first-page":"274","article-title":"Optimal simulations of tree machines","author":"Bhatt","year":"1986"},{"issue":"1","key":"10.1016\/j.dam.2026.03.028_b2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s00453-006-1209-y","article-title":"Tree spanners for bipartite graphs and probe interval graphs","volume":"47","author":"Brandstadt","year":"2007","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/j.dam.2026.03.028_b3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S0895480192237403","article-title":"Tree spanners","volume":"8","author":"Cai","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2026.03.028_b4","first-page":"46","article-title":"Tree t-spanners of a graph: Minimizing maximum distances efficiently","volume":"vol. 11346","author":"Couto","year":"2018"},{"key":"10.1016\/j.dam.2026.03.028_b5","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.entcs.2019.08.032","article-title":"Hardness and efficiency on minimizing maximum distances for graphs with few P4\u2019s and (k, \u2113)-graphs","volume":"346","author":"Couto","year":"2019","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.dam.2026.03.028_b6","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.dam.2021.08.010","article-title":"Hardness and efficiency on t-admissibility for graph operations","volume":"304","author":"Couto","year":"2021","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.028_b7","first-page":"195","article-title":"Edge tree spanners","author":"Couto","year":"2021"},{"key":"10.1016\/j.dam.2026.03.028_b8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.endm.2018.07.036","article-title":"Chordal-(2, 1) graph sandwich problem with boundary conditions","volume":"69","author":"Couto","year":"2018","journal-title":"Electron. Notes Discrete Math."},{"issue":"1\u20132","key":"10.1016\/j.dam.2026.03.028_b9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0166-218X(00)00226-2","article-title":"Tree spanners in planar graphs","volume":"108","author":"Fekete","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.028_b10","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.dam.2026.03.028_b11","doi-asserted-by":"crossref","DOI":"10.46298\/dmtcs.232","article-title":"On P4-tidy graphs","volume":"1","author":"Giakoumakis","year":"1997","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"10.1016\/j.dam.2026.03.028_b12","series-title":"Kneser Graphs.Algebraic Graph Theory","first-page":"135","author":"Godsil","year":"2001"},{"key":"10.1016\/j.dam.2026.03.028_b13","series-title":"Latin American Symposium on Theoretical Informatics","first-page":"557","article-title":"Tree 3-spanners on generalized prisms of graphs","author":"G\u00f3mez","year":"2022"},{"key":"10.1016\/j.dam.2026.03.028_b14","series-title":"Graph Theory","first-page":"71","article-title":"Line graphs","author":"Harary","year":"1972"},{"issue":"1","key":"10.1016\/j.dam.2026.03.028_b15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0166-218X(86)90019-3","article-title":"A polynomial algorithm for constructing the clique graph of a line graph","volume":"15","author":"Hedman","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.028_b16","article-title":"Treewidth, partial k-trees, and chordal graphs","author":"Heggernes","year":"2005","journal-title":"INF334-Advanced Algorithmical Tech. Dep. Inform. Univ. Bergen"},{"issue":"3","key":"10.1016\/j.dam.2026.03.028_b17","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/S0895480191196812","article-title":"P-components and the homogeneous decomposition of graphs","volume":"8","author":"Jamison","year":"1995","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"10.1016\/j.dam.2026.03.028_b18","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/321850.321853","article-title":"An optimal algorithm to detect a line graph and output its root graph","volume":"21","author":"Lehot","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/j.dam.2026.03.028_b19","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1016\/j.dam.2007.07.001","article-title":"The zoo of tree spanner problems","volume":"156","author":"Liebchen","year":"2008","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.dam.2026.03.028_b20","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/0218050","article-title":"An optimal synchronizer for the hypercube","volume":"18","author":"Peleg","year":"1989","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600168X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600168X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T08:36:21Z","timestamp":1778488581000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X2600168X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":20,"alternative-id":["S0166218X2600168X"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.028","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tree -spanners for edge adjacency distances","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.028","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"}]}}