{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:25:48Z","timestamp":1787509548567,"version":"build-2736575974"},"reference-count":11,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/0020-0190(92)90228-n","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"309-313","source":"Crossref","is-referenced-by-count":17,"title":["An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3"],"prefix":"10.1016","volume":"42","author":[{"given":"Elias","family":"Dahlhaus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Kelsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90228-N_BIB1","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","article-title":"A fast randomized parallel algorithm for the maximal independent set problem","volume":"7","author":"Alon","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(92)90228-N_BIB2","author":"Beame","year":"1991","journal-title":"Personal communication"},{"key":"10.1016\/0020-0190(92)90228-N_BIB3","series-title":"Tech. Rept. TR-89-003","first-page":"212","article-title":"Parallel search for maximal independence given minimal dependence","author":"Beame","year":"1989"},{"key":"10.1016\/0020-0190(92)90228-N_BIB4","series-title":"Tech. Rept. TR-89-052","article-title":"An efficient parallel algorithm for the 3MIS problem","author":"Dahlhaus","year":"1989"},{"key":"10.1016\/0020-0190(92)90228-N_BIB5","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1137\/0218029","article-title":"A new parallel algorithm for the maximal independent set problem","volume":"18","author":"Goldberg","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90228-N_BIB6","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0402028","article-title":"Constructing a maximal independent set in parallel","volume":"2","author":"Goldberg","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0020-0190(92)90228-N_BIB7","series-title":"Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity","first-page":"869","article-title":"Parallel algorithms for shared memory machines","author":"Karp","year":"1990"},{"key":"10.1016\/0020-0190(92)90228-N_BIB8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0022-0000(88)90027-X","article-title":"The complexity of parallel search","volume":"36","author":"Karp","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(92)90228-N_BIB9","series-title":"Manuscript","article-title":"An efficient parallel algorithm for finding a maximal independent set in hypergraphs of dimension 3","author":"Kelsen","year":"1990"},{"key":"10.1016\/0020-0190(92)90228-N_BIB10","article-title":"On the parallel complexity of computing a maximal independent set in a hypergraph","author":"Kelsen","year":"1992","journal-title":"Proc. 24th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90228-N_BIB11","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","article-title":"A simple parallel algorithm for the maximal independent set problem","volume":"15","author":"Luby","year":"1986","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290228N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290228N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:55Z","timestamp":1555129675000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290228N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["002001909290228N"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90228-n","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}