{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T02:57:21Z","timestamp":1648781841305},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,3,1]],"date-time":"1979-03-01T00:00:00Z","timestamp":289094400000},"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":[[1979,3]]},"DOI":"10.1016\/0020-0190(79)90006-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"141-145","source":"Crossref","is-referenced-by-count":1,"title":["An intermediate-value theorem for optimum tree valuation"],"prefix":"10.1016","volume":"8","author":[{"given":"Sukhamay","family":"Kundu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90006-1_BIB1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0125042","article-title":"Optimal linear ordering","volume":"25","author":"Adolphson","year":"1973","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0020-0190(79)90006-1_BIB2","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1137\/1019082","article-title":"A conjectured minimum valuation tree","volume":"19","author":"Cahit","year":"1977","journal-title":"SIAM Rev."},{"key":"10.1016\/0020-0190(79)90006-1_BIB3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(75)90045-9","article-title":"On the graceful numbering of spanning trees","volume":"3","author":"Cahit","year":"1975","journal-title":"Information Processing Lett."},{"key":"10.1016\/0020-0190(79)90006-1_BIB4","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/1020084","article-title":"Problems and solution section (77-15)","volume":"20","author":"Chung","year":"1978","journal-title":"SIAM Rev."},{"key":"10.1016\/0020-0190(79)90006-1_BIB5","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\/0020-0190(79)90006-1_BIB6","series-title":"Graph Theory and Computing","first-page":"23","article-title":"How to number a graph","author":"Golomb","year":"1972"},{"key":"10.1016\/0020-0190(79)90006-1_BIB7","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/1014035","article-title":"A review of the placement and quadratic assignment problem","volume":"14","author":"Hannon","year":"1972","journal-title":"SIAM Rev."},{"key":"10.1016\/0020-0190(79)90006-1_BIB8","unstructured":"Y. Shiloach, A minimum linear arrangement algorithm for undirected trees, preprint."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900061?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900061?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:28:41Z","timestamp":1555072121000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079900061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,3]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,3]]}},"alternative-id":["0020019079900061"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90006-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,3]]}}}