{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:08Z","timestamp":1759638368468},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0020-0190(96)00078-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:21:21Z","timestamp":1027621281000},"page":"97-102","source":"Crossref","is-referenced-by-count":41,"title":["Tree 3-spanners on interval, permutation and regular bipartite graphs"],"prefix":"10.1016","volume":"59","author":[{"given":"M.S.","family":"Madanlal","sequence":"first","affiliation":[]},{"given":"G.","family":"Venkatesan","sequence":"additional","affiliation":[]},{"given":"C.Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00078-6_BIB1","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(96)00078-6_BIB2","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(96)00078-6_BIB3","unstructured":"Leizhen Cai, Tree spanners: Spanning trees that approximate distances. Tech. Rept. 260\/92, Dept. of Computer Science, University of Toronto."},{"key":"10.1016\/0020-0190(96)00078-6_BIB4","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","article-title":"A unified approach to domination problems on interval graphs","volume":"27","author":"Ramalingam","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00078-6_BIB5","series-title":"Proc. 6th ACM Symp. on Principles of Distributed Computing","first-page":"77","article-title":"An optimal synchronizer for the hypercube","author":"Peleg","year":"1987"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000786?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000786?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:24:11Z","timestamp":1556058251000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0020019096000786"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00078-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}