{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T10:27:39Z","timestamp":1673432859676},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"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":[[1988,6]]},"DOI":"10.1016\/0020-0190(88)90172-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"105-110","source":"Crossref","is-referenced-by-count":5,"title":["A parallel algorithm for recognizing unordered depth-first search"],"prefix":"10.1016","volume":"28","author":[{"given":"Catherine A.","family":"Schevon","sequence":"first","affiliation":[]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90172-X_BIB1","doi-asserted-by":"crossref","DOI":"10.1007\/BF02122548","article-title":"A random NC algorithm for depth first search","volume":"8","author":"Aggarwal","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(88)90172-X_BIB2","first-page":"1","article-title":"Matrix multiplication via arithmetic progressions","author":"Coppersmith","year":"1987","journal-title":"Proc. 19th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(88)90172-X_BIB3","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01937481","article-title":"A parallel search algorithm for directed acyclic graphs","volume":"24","author":"Ghosh","year":"1984","journal-title":"BIT"},{"key":"10.1016\/0020-0190(88)90172-X_BIB4","article-title":"Depth First Search is Inherently Sequential","author":"Reif","year":"1983","journal-title":"Aiken Computation Lab. Tech. Rept. TR-27-83"},{"issue":"2","key":"10.1016\/0020-0190(88)90172-X_BIB5","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","article-title":"Finding the maximum, merging, and sorting in a parallel computation model","volume":"7","author":"Shiloach","year":"1981","journal-title":"J. Algorithms"},{"issue":"6","key":"10.1016\/0020-0190(88)90172-X_BIB6","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/0216073","article-title":"Parallel algorithms for depth-first searches: I. Planar graphs","volume":"16","author":"Smith","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(88)90172-X_BIB7","first-page":"12","article-title":"Finding biconnected components and computing tree functions in logarithmic parallel time","author":"Tarjan","year":"1984","journal-title":"Proc. 25th Ann. IEEE Symp. on Foundations of Computer Science"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908890172X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908890172X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:21:12Z","timestamp":1555089672000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908890172X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["002001908890172X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90172-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}