{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:10:01Z","timestamp":1759061401038,"version":"3.44.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-218x(01)00174-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:10:32Z","timestamp":1027599032000},"page":"243-253","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal arrangement of data in a tree directory"],"prefix":"10.1016","volume":"113","author":[{"given":"M.J.","family":"Luczak","sequence":"first","affiliation":[]},{"given":"S.D.","family":"Noble","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00174-3_BIB1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0095-8956(90)90066-9","article-title":"On embedding graphs in trees","volume":"49","author":"Bienstock","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(01)00174-3_BIB2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0898-1221(84)90085-3","article-title":"On optimal linear arrangements of trees","volume":"10","author":"Chung","year":"1984","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0166-218X(01)00174-3_BIB3","series-title":"Selected Topics in Graph Theory, Vol. 3","first-page":"151","article-title":"Labellings of graphs","author":"Chung","year":"1988"},{"key":"10.1016\/S0166-218X(01)00174-3_BIB4","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","article-title":"Complexity results for bandwidth minimization","volume":"34","author":"Garey","year":"1978","journal-title":"SIAM J. Appl. Math."},{"year":"1979","series-title":"Computers and Intractability","author":"Garey","key":"10.1016\/S0166-218X(01)00174-3_BIB5"},{"key":"10.1016\/S0166-218X(01)00174-3_BIB6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(01)00174-3_BIB7","unstructured":"M.A. Goldberg, I.A. Klipker, Minimal placing of trees on a line, Technical Report, Physico-Technical Institute of Low Temperatures, Academy of Sciences of Ukranian SSR, USSR, 1976."},{"key":"10.1016\/S0166-218X(01)00174-3_BIB8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0112012","article-title":"Optimal assignments of numbers to vertices","volume":"12","author":"Harper","year":"1964","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"10.1016\/S0166-218X(01)00174-3_BIB9","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0166-218X(01)00174-3_BIB10","unstructured":"I. Novoa, M. Wilby, Knowledge and location, in: Proceedings of the International Joint Conference on Artificial Intelligence, Montreal, August 1997."},{"key":"10.1016\/S0166-218X(01)00174-3_BIB11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/0208002","article-title":"A minimum linear arrangement algorithm for undirected trees","volume":"8","author":"Shiloach","year":"1979","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001743?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001743?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:56:54Z","timestamp":1759060614000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01001743"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":11,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X01001743"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00174-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2001,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal arrangement of data in a tree directory","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(01)00174-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}