{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T05:11:10Z","timestamp":1648789870092},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6376,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1016\/0166-218x(94)00128-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"249-265","source":"Crossref","is-referenced-by-count":0,"title":["Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM"],"prefix":"10.1016","volume":"64","author":[{"given":"G.","family":"Sajith","sequence":"first","affiliation":[]},{"given":"Sanjeev","family":"Saxena","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00128-Z_BIB1","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/0196-6774(86)90019-2","article-title":"A fast and simple randomized parallel algorithm for the maximal independent set problem","volume":"7","author":"Alon","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(94)00128-Z_BIB2","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1007\/BF01759076","article-title":"Deterministic parallel list ranking","volume":"6","author":"Anderson","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(94)00128-Z_BIB3","series-title":"Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"11","article-title":"Finding connected components in O (log n log log n) time on the EREW PRAM","author":"Chong","year":"1993"},{"key":"10.1016\/0166-218X(94)00128-Z_BIB4","series-title":"Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science","first-page":"478","article-title":"Approximate and exact parallel scheduling with applications to list, tree and graph problems","author":"Cole","year":"1986"},{"key":"10.1016\/0166-218X(94)00128-Z_BIB5","series-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","first-page":"315","article-title":"Parallel symmetry breaking in sparse graphs","author":"Goldberg","year":"1987"},{"key":"10.1016\/0166-218X(94)00128-Z_BIB6","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1137\/0218029","article-title":"A new parallel algorithm for the maximal independant set problem","volume":"18","author":"Goldberg","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(94)00128-Z_BIB7","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\/0166-218X(94)00128-Z_BIB8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1137\/0403008","article-title":"Brooks' colouring in parallel","volume":"3","author":"Hajnal","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0166-218X(94)00128-Z_BIB9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1006\/jagm.1994.1009","article-title":"A simpler parallel algorithm for graph connectivity","volume":"16","author":"Iwama","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(94)00128-Z_BIB10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0196-6774(88)90006-5","article-title":"A fast parallel algorithm to colour a graph with \u0394 colours","volume":"9","author":"Karchmer","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(94)00128-Z_BIB11","article-title":"Fast parallel algorithms for graph theoretic problems: matching, coloring and partitioning","author":"Karloff","year":"1985"},{"key":"10.1016\/0166-218X(94)00128-Z_BIB12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0304-3975(89)90121-7","article-title":"An NC algorithm for Brooks' theorem","volume":"68","author":"Karloff","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(94)00128-Z_BIB13","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/4221.4226","article-title":"A fast parallel algorithm for the maximal independent set problem","volume":"32","author":"Karp","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)00128-Z_BIB14","series-title":"Combinatorial Problems and Exercises","author":"Lovasz","year":"1979"},{"key":"10.1016\/0166-218X(94)00128-Z_BIB15","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\/0166-218X(94)00128-Z_BIB16","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."},{"key":"10.1016\/0166-218X(94)00128-Z_BIB17","series-title":"Proceedings of the 24th Annual ACM Symposium on Theory of Computing","first-page":"581","article-title":"Improved distributed algorithms for colouring and network decomposition problems","author":"Panconesi","year":"1992"},{"key":"10.1016\/0166-218X(94)00128-Z_BIB18","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0020-0190(94)90104-X","article-title":"Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent set in rooted trees","volume":"49","author":"Sajith","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(94)00128-Z_BIB19","series-title":"Introduction to Graph Theory","author":"Wilson","year":"1979"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400128Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400128Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:09Z","timestamp":1556130429000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9400128Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0166218X9400128Z"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00128-z","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}