{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T20:10:46Z","timestamp":1781381446956,"version":"3.54.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"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":[[1990,4]]},"DOI":"10.1016\/0020-0190(90)90155-q","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"167-171","source":"Crossref","is-referenced-by-count":20,"title":["Recognizing breadth-first search trees in linear time"],"prefix":"10.1016","volume":"34","author":[{"given":"Udi","family":"Manber","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90155-Q_BIB1","series-title":"Proc. 30th Annual Symposium on Foundations of Computer Science","first-page":"196","article-title":"Recursive \u2217-tree parallel data structure","author":"Berkman","year":"1989"},{"key":"10.1016\/0020-0190(90)90155-Q_BIB2","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(90)90155-Q_BIB3","article-title":"DFS tree construction: Algorithms and characterizations","author":"Korach","year":"1988","journal-title":"the 14th International Workshop on Graph-Theoretic Concepts in Computer Science"},{"key":"10.1016\/0020-0190(90)90155-Q_BIB4","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","article-title":"On finding lowest common ancestors: Simplification and parallelization","volume":"17","author":"Schieber","year":"1988","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090155Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090155Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:59:04Z","timestamp":1555088344000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090155Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["002001909090155Q"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90155-q","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}