{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:28:25Z","timestamp":1740104905990,"version":"3.37.3"},"reference-count":9,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2007,7,5]],"date-time":"2007-07-05T00:00:00Z","timestamp":1183593600000},"content-version":"vor","delay-in-days":5878,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/100004415","name":"NATO","doi-asserted-by":"crossref","award":["RG0088\/89","RG0088\/89"],"award-info":[{"award-number":["RG0088\/89","RG0088\/89"]}],"id":[{"id":"10.13039\/100004415","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF","award":["CCR-8900112"],"award-info":[{"award-number":["CCR-8900112"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1991,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We describe an <jats:italic>O<\/jats:italic>((log n)<jats:sup>2<\/jats:sup>) time parallel algorithm, using <jats:italic>n<\/jats:italic> processors, for finding the lexicographically first depth first search tree in the random graph G <jats:sub>n, p<\/jats:sub>, with <jats:italic>p<\/jats:italic> fixed. The problem itself is complete for <jats:italic>P<\/jats:italic>, and so is unlikely to be efficiently parallelizable always.<\/jats:p>","DOI":"10.1002\/rsa.3240020207","type":"journal-article","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T06:02:21Z","timestamp":1278914541000},"page":"233-239","source":"Crossref","is-referenced-by-count":1,"title":["Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph"],"prefix":"10.1002","volume":"2","author":[{"given":"Martin","family":"Dyer","sequence":"first","affiliation":[]},{"given":"Alan","family":"Friezet","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,7,5]]},"reference":[{"key":"e_1_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90105-0"},{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122548"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0219025"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010104"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90035-7"},{"volume-title":"An Introduction to Probability Theory and Its Applications","year":"1968","author":"Feller W.","key":"e_1_2_1_6_2"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"A.Goldberg S.Plotkin andP.Vaidya Sublinear time parallel algorithms for matching and related problems Proceedings of the 29th IEEE Symposium on Foundations of Computing 1988.","DOI":"10.1109\/SFCS.1988.21935"},{"key":"e_1_2_1_8_2","first-page":"47","volume-title":"Randomness and Computation","author":"Miller G. L.","year":"1989"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"J. H.Reif Depth\u2010first search is inherently sequential.Inf. Process. Lett. 229\u2013234(1985).","DOI":"10.1016\/0020-0190(85)90024-9"}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240020207","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240020207","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240020207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T05:08:47Z","timestamp":1698037727000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240020207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["10.1002\/rsa.3240020207"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240020207","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"type":"print","value":"1042-9832"},{"type":"electronic","value":"1098-2418"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}