{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:23:23Z","timestamp":1757629403380,"version":"3.44.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0743-7315(89)90027-0","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"383-390","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel-depth search for acyclic digraphs"],"prefix":"10.1016","volume":"7","author":[{"given":"G.","family":"Bongiovanni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Petreschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(89)90027-0_BIB1","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0207020","article-title":"Parallel computations in graph theory","volume":"7","author":"Regbati","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0743-7315(89)90027-0_BIB2","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."},{"key":"10.1016\/0743-7315(89)90027-0_BIB3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","article-title":"Depth-first search is inherently sequential","volume":"20","author":"Reif","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(89)90027-0_BIB4","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1137\/0215058","article-title":"Parallel algorithms for depth-first searches I. Planar graphs","volume":"15","author":"Smith","year":"1986","journal-title":"SIAM J Comput."},{"key":"10.1016\/0743-7315(89)90027-0_BIB5","doi-asserted-by":"crossref","unstructured":"He, X., Yesha, Y., A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs, TR-17, Department of Computer and Information Science, Ohio State University","DOI":"10.1137\/0217028"},{"key":"10.1016\/0743-7315(89)90027-0_BIB6","series-title":"Tech Rep. 79-387","article-title":"The complexity of parallel computation","author":"Wyllie","year":"1979"},{"year":"1976","series-title":"Fundamentals of Data Structures","author":"Horowitz","key":"10.1016\/0743-7315(89)90027-0_BIB7"},{"key":"10.1016\/0743-7315(89)90027-0_BIB8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/2514.2516","article-title":"A taxonomy of parallel sorting","volume":"16","author":"Bitton","year":"1984","journal-title":"ACM Comput. Surveys"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900270?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900270?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:41Z","timestamp":1757514641000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731589900270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0743731589900270"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(89)90027-0","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1989,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parallel-depth search for acyclic digraphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(89)90027-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}