{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T22:54:57Z","timestamp":1681772097026},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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":[[1996,4]]},"DOI":"10.1016\/0020-0190(96)00040-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:07:29Z","timestamp":1027609649000},"page":"55-58","source":"Crossref","is-referenced-by-count":6,"title":["A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity"],"prefix":"10.1016","volume":"58","author":[{"given":"Oscar","family":"Garrido","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Kelsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00040-3_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1970"},{"key":"10.1016\/0020-0190(96)00040-3_BIB2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0020-0190(92)90228-N","article-title":"An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3","volume":"42","author":"Dahlhaus","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00040-3_BIB3","doi-asserted-by":"crossref","DOI":"10.1137\/0401044","article-title":"Parallel symmetry-breaking in sparse graphs","volume":"1","author":"Goldberg","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0020-0190(96)00040-3_BIB4","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(96)00040-3_BIB5","series-title":"Proceedings 23th Annual ACM Symposium on Theory of Computing","first-page":"190","article-title":"Probabilistic recurrence relations","author":"Karp","year":"1991"},{"key":"10.1016\/0020-0190(96)00040-3_BIB6","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/0020-0190(96)00040-3_BIB7","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(96)00040-3_BIB8","series-title":"Proceedings 16th Annual ACM Symposium on Theory of Computing","article-title":"A fast parallel algorithm for the maximal independent set problem","author":"Karp","year":"1984"},{"key":"10.1016\/0020-0190(96)00040-3_BIB9","series-title":"Proceedings 24th Annual ACM Symposium on Theory of Computing","article-title":"On the parallel complexity of computing a maximal independent set in a hypergraph","author":"Kelsen","year":"1992"},{"key":"10.1016\/0020-0190(96)00040-3_BIB10","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."},{"key":"10.1016\/0020-0190(96)00040-3_BIB11","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/0022-0000(93)90033-S","article-title":"Removing randomness in parallel computation without a processor penalty","volume":"47","author":"Luby","year":"1993","journal-title":"J. Comput. System Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000403?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000403?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:54:23Z","timestamp":1556376863000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0020019096000403"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00040-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}