{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T05:42:07Z","timestamp":1698039727539},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":[[1987,1]]},"DOI":"10.1016\/0020-0190(87)90105-0","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"121-126","source":"Crossref","is-referenced-by-count":18,"title":["Parallelism and the maximal path problem"],"prefix":"10.1016","volume":"24","author":[{"given":"Richard","family":"Anderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernst W.","family":"Mayr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(87)90105-0_BIB1","series-title":"Proc. 17th Ann. ACM Symp. on Theory of Computing","first-page":"33","article-title":"A parallel algorithm for the maximal path problem","author":"Anderson","year":"1985"},{"key":"10.1016\/0020-0190(87)90105-0_BIB2","series-title":"Tech. Rept. No. STAN-CS-84-1003","article-title":"Parallelism and greedy algorithms","author":"Anderson","year":"1984"},{"key":"10.1016\/0020-0190(87)90105-0_BIB3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(87)90105-0_BIB4","series-title":"Proc. 10th Ann. ACM Symp. on Theory of Computing","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978"},{"issue":"2","key":"10.1016\/0020-0190(87)90105-0_BIB5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008354.1008356","article-title":"The monotone and planar circuit value problems are log space complete for P","volume":"9","author":"Goldschlager","year":"1977","journal-title":"ACM SIGACT News"},{"key":"10.1016\/0020-0190(87)90105-0_BIB6","series-title":"Proc. 16th Ann. ACM Symp. on Theory of Computing","first-page":"266","article-title":"A fast parallel algorithm for the maximal independent set problem","author":"Karp","year":"1984"},{"issue":"1","key":"10.1016\/0020-0190(87)90105-0_BIB7","first-page":"583","article-title":"The circuit value problem is log space complete for P","volume":"7","author":"Lander","year":"1975","journal-title":"ACM SIGACT News"},{"key":"10.1016\/0020-0190(87)90105-0_BIB8","series-title":"Parallel algorithms for depth first searches, Part I: Planar graphs","author":"Smith","year":"1983"},{"key":"10.1016\/0020-0190(87)90105-0_BIB9","series-title":"Proc. 25th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"12","article-title":"Finding biconnected components and computing tree functions in logarithmic parallel time","author":"Tarjan","year":"1984"},{"key":"10.1016\/0020-0190(87)90105-0_BIB10","series-title":"Rept. RC 9149","article-title":"An optimal parallel connectivity algorithm","author":"Vishkin","year":"1981"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901050?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901050?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:51:46Z","timestamp":1553593906000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087901050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["0020019087901050"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90105-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}