{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:24:46Z","timestamp":1747578286488},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1983,12]]},"DOI":"10.1016\/0196-6774(83)90015-9","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"345-352","source":"Crossref","is-referenced-by-count":29,"title":["On finding the core of a tree with a specified length"],"prefix":"10.1016","volume":"4","author":[{"given":"Edward","family":"Minieka","sequence":"first","affiliation":[]},{"given":"Niranjani H","family":"Patel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(83)90015-9_BIB1","series-title":"Location on Networks","author":"Handler","year":"1979"},{"key":"10.1016\/0196-6774(83)90015-9_BIB2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/jgt.3190020304","article-title":"Centers to centroids in graphs","volume":"2","author":"Slater","year":"1978","journal-title":"J. Graph Theory"},{"key":"10.1016\/0196-6774(83)90015-9_BIB3","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1287\/opre.29.3.523","article-title":"On locating a facility to service areas in a network","volume":"29","author":"Slater","year":"1981","journal-title":"Oper. Res."},{"key":"10.1016\/0196-6774(83)90015-9_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.16.1.1","article-title":"Locating central paths in a graph","volume":"16","author":"Slater","year":"1982","journal-title":"Transportation Sci."},{"key":"10.1016\/0196-6774(83)90015-9_BIB5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","article-title":"A linear algorithm for a core of a tree","volume":"1","author":"Morgan","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(83)90015-9_BIB6","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","article-title":"Optimum distribution of switching centers in a communication network and some related graph theoretic problems","volume":"13","author":"Hakimi","year":"1965","journal-title":"Oper. Res."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677483900159?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677483900159?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:50:56Z","timestamp":1548744656000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677483900159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["0196677483900159"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(83)90015-9","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}