{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T02:17:10Z","timestamp":1649125030154},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":[[1992,7]]},"DOI":"10.1016\/0020-0190(92)90031-p","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"243-248","source":"Crossref","is-referenced-by-count":2,"title":["A simple parallel algorithm for computing the diameters of all vertices in a tree and its application"],"prefix":"10.1016","volume":"42","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90031-P_BIB1","author":"Akl","year":"1989"},{"issue":"1","key":"10.1016\/0020-0190(92)90031-P_BIB2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0020-0190(91)90214-3","article-title":"A unified approach to parallel depth-first traversals of general trees","volume":"38","author":"Chen","year":"1991","journal-title":"Inform. Process. Lett."},{"issue":"5","key":"10.1016\/0020-0190(92)90031-P_BIB3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(91)90117-Z","article-title":"A randomized NC algorithm for the maximal tree cover problem","volume":"40","author":"Chen","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90031-P_BIB4","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90031-P_BIB5","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1137\/0218029","article-title":"A new parallel algorithm for the maximal independent set problem","volume":"18","author":"Goldberg","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90031-P_BIB6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0890-5401(90)90034-F","article-title":"Optimal parallel algorithms on planar graphs","volume":"84","author":"Hagerup","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(92)90031-P_BIB7","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290031P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290031P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:44Z","timestamp":1555144064000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290031P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["002001909290031P"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90031-p","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}