{"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":1698039727438},"reference-count":2,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6068,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1990,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider a natural parallel version of the classical greedy algorithm for finding a maximal independent set in a graph. This version was studied in Coppersmith, Raghavan, and Tompa and they conjecture there that its expected running time on random graphs <jats:italic>of arbitrary edge density of O<\/jats:italic> (log <jats:italic>n<\/jats:italic>). We prove that conjecture.<\/jats:p>","DOI":"10.1002\/rsa.3240010104","type":"journal-article","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T05:08:54Z","timestamp":1180588134000},"page":"39-50","source":"Crossref","is-referenced-by-count":28,"title":["Probabilistic analysis of a parallel algorithm for finding maximal independent sets"],"prefix":"10.1002","volume":"1","author":[{"given":"Neil","family":"Calkin","sequence":"first","affiliation":[]},{"given":"Alan","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"D.Coppersmith P.Raghavan andM.Tompa \u201cParallel graph algorithms that are efficient on average \u201d Proc. 28th Annual IEEE Symp. Foundations of Computer Science 260\u2013269(1987).","DOI":"10.1109\/SFCS.1987.46"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80041-3"}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240010104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240010104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T09:42:03Z","timestamp":1697967723000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240010104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":2,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["10.1002\/rsa.3240010104"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240010104","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}