{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T13:40:06Z","timestamp":1697463606682},"reference-count":4,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2007,3,9]],"date-time":"2007-03-09T00:00:00Z","timestamp":1173398400000},"content-version":"vor","delay-in-days":5546,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1992,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider the parallel greedy algorithm of Coppersmith, Raghavan, and Tompa (<jats:italic>Proc. of 28th Annual IEEE Symp. on Foundations of Computer Science<\/jats:italic>, pp. 260\u2013269, 1987) for finding the lexicographically first maximal independent set of a graph. We prove an \u03a9(log <jats:italic>n<\/jats:italic>) bound on the expected number of iterations for most edge densities. This complements the <jats:italic>O<\/jats:italic>(log <jats:italic>n<\/jats:italic>) bound proved in Calkin and Frieze (<jats:italic>Random Structures and Algorithms<\/jats:italic>, Vol. 1, pp. 39\u201350, 1990).<\/jats:p>","DOI":"10.1002\/rsa.3240030210","type":"journal-article","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T08:51:32Z","timestamp":1180601492000},"page":"215-221","source":"Crossref","is-referenced-by-count":1,"title":["On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph"],"prefix":"10.1002","volume":"3","author":[{"given":"Neil J.","family":"Calkin","sequence":"first","affiliation":[]},{"given":"A. M.","family":"Frieze","sequence":"additional","affiliation":[]},{"given":"L.","family":"Ku\u010dera","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,9]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010104"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80041-3"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"D.Coppersmith P.Raghavan andM.Tompa Parallel graph algorithms that are efficient on average Proceedings of 28th Annual IEEE Symposium on Foundations of Computer Science 260\u2013269(1987).","DOI":"10.1109\/SFCS.1987.46"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding W.","year":"1963","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240030210","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240030210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T13:50:14Z","timestamp":1697377814000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240030210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["10.1002\/rsa.3240030210"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240030210","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}