{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:33Z","timestamp":1759637613303},"reference-count":31,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7412,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0012-365x(93)90375-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"305-327","source":"Crossref","is-referenced-by-count":5,"title":["Recognition of DFS trees: sequential and parallel algorithms with refined verifications"],"prefix":"10.1016","volume":"114","author":[{"given":"Ephraim","family":"Korach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zvi","family":"Ostfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90375-4_BIB1","doi-asserted-by":"crossref","first-page":"1","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\/0012-365X(93)90375-4_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0012-365X(93)90375-4_BIB3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(85)90083-3","article-title":"A new distributed depth-first-search algorithm","volume":"20","author":"Awerbuch","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(93)90375-4_BIB4","first-page":"1736","article-title":"Graph Theory","author":"Biggs","year":"1977"},{"key":"10.1016\/0012-365X(93)90375-4_BIB5","first-page":"511","article-title":"Parallel merge sort","author":"Cole","year":"1986","journal-title":"Proc. 27th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0012-365X(93)90375-4_BIB6","first-page":"478","article-title":"Approximate and exact parallel scheduling with application to list, tree and graph problems","author":"Cole","year":"1986","journal-title":"27th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0012-365X(93)90375-4_BIB7","first-page":"1","article-title":"Matrix multiplication via arithmetic progression","author":"Coppersmith","year":"1987","journal-title":"Proc. 19th ACM Symp. on Theory of Computation"},{"key":"10.1016\/0012-365X(93)90375-4_BIB8","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0012-365X(93)90375-4_BIB9","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/BF01762131","article-title":"On finding optimal and near-optimal linear spanning trees","volume":"3","author":"Fellows","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0012-365X(93)90375-4_BIB10","series-title":"Tech. Report A 85\/08","article-title":"Recognition of spanning trees defined by graph searches","author":"Hagerup","year":"1985"},{"key":"10.1016\/0012-365X(93)90375-4_BIB11","first-page":"308","article-title":"A linear time algorithm for the lowest common ancestors problem","author":"Harel","year":"1980","journal-title":"Proc. 21th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0012-365X(93)90375-4_BIB12","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1137\/0217028","article-title":"A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs","volume":"17","author":"He","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(93)90375-4_BIB13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(93)90375-4_BIB14","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","article-title":"Efficient algorithms for graph manipulation","volume":"16","author":"Hopcroft","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/0012-365X(93)90375-4_BIB15","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0012-365X(93)90375-4_BIB16","series-title":"14th Internat. Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"87","article-title":"DFS tree construction: algorithms and characterizations","volume":"Vol. 344","author":"Korach","year":"1988"},{"key":"10.1016\/0012-365X(93)90375-4_BIB17","series-title":"Tech. Report no. 508","article-title":"On the possibilities of DFS tree constructions: sequential and parallel algorithms","author":"Korach","year":"1988"},{"key":"10.1016\/0012-365X(93)90375-4_BIB18","unstructured":"E. Korach and Z. Ostfeld, Hamiltonian and degree restricted DFS trees, manuscript submitted."},{"key":"10.1016\/0012-365X(93)90375-4_BIB19","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0012-365X(93)90375-4_BIB20","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0190(87)90228-6","article-title":"A time-optimal message-efficient distributed algorithm for depth-first-search","volume":"25","author":"Lakshmanan","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(93)90375-4_BIB21","first-page":"143","article-title":"Efficient parallel solution of linear systems","author":"Pan","year":"1985","journal-title":"Proc. 17th ACM Symp. on Theory of Computation"},{"key":"10.1016\/0012-365X(93)90375-4_BIB22","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\/0012-365X(93)90375-4_BIB23","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0020-0190(88)90172-X","article-title":"A parallel algorithm for recognizing unordered depth-first search","volume":"28","author":"Schevon","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(93)90375-4_BIB24","unstructured":"B. Schieber, private communication, March 1989."},{"key":"10.1016\/0012-365X(93)90375-4_BIB25","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."},{"key":"10.1016\/0012-365X(93)90375-4_BIB26","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\/0012-365X(93)90375-4_BIB27","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1109\/TCS.1984.1085460","article-title":"Series-parallel graphs and depth-first search trees","volume":"31","author":"Syslo","year":"1984","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0012-365X(93)90375-4_BIB28","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(93)90375-4_BIB29","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\/0012-365X(93)90375-4_BIB30","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0196-6774(86)90040-4","article-title":"An efficient parallel algorithm for shifting the root of a depth first spanning tree","author":"Tiwari","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(93)90375-4_BIB31","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(85)90025-0","article-title":"On efficient parallel strong orientation","volume":"20","author":"Vishkin","year":"1985","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93903754?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93903754?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:52:50Z","timestamp":1555120370000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X93903754"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":31,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["0012365X93903754"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90375-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}