{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:25:23Z","timestamp":1772043923207,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8233,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0166-218x(91)90012-l","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"43-52","source":"Crossref","is-referenced-by-count":52,"title":["On an edge ranking problem of trees and graphs"],"prefix":"10.1016","volume":"30","author":[{"given":"Ananth.V.","family":"Iyer","sequence":"first","affiliation":[]},{"given":"H.Donald","family":"Ratliff","sequence":"additional","affiliation":[]},{"given":"Gopalakrishnan","family":"Vijayan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/0166-218X(91)90012-L_BIB1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(88)90194-9","article-title":"Optimal node ranking of trees","volume":"28","author":"Iyer","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(91)90012-L_BIB2","series-title":"Tech. Rept. 88-06","article-title":"Parallel assembly of modular products","author":"Iyer","year":"1988"},{"key":"10.1016\/0166-218X(91)90012-L_BIB3","series-title":"Ordered colourings","author":"Katchalski","year":"1988"},{"key":"10.1016\/0166-218X(91)90012-L_BIB4","series-title":"Optimal node rankings of trees in linear time","author":"Schaffer","year":"1988"},{"key":"10.1016\/0166-218X(91)90012-L_BIB5","series-title":"Computational Aspects of VLSI","author":"Ullman","year":"1984"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190012L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190012L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:58:03Z","timestamp":1555135083000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9190012L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0166218X9190012L"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90012-l","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}