{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:27:36Z","timestamp":1762270056251},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"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":8690,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0304-3975(89)90121-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"89-103","source":"Crossref","is-referenced-by-count":14,"title":["An NC algorithm for Brooks' Theorem"],"prefix":"10.1016","volume":"68","author":[{"given":"Howard J.","family":"Karloff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90121-7_BIB1","first-page":"337","article-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0304-3975(89)90121-7_BIB2","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/0196-6774(87)90046-0","article-title":"Coloring planar graphs in parallel","volume":"8","author":"Boyar","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(89)90121-7_BIB3","series-title":"Graph Theory: An Introductory Course","author":"Bollob\u00e1s","year":"1979"},{"key":"10.1016\/0304-3975(89)90121-7_BIB4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90121-7_BIB5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1109\/SFCS.1987.2","article-title":"A new parallel algorithm for the maximal independent set problem","author":"Goldberg","year":"1987","journal-title":"Proc. 28th Ann. IEEE Symp. on the Foundations of Computer Science"},{"key":"10.1016\/0304-3975(89)90121-7_BIB6","doi-asserted-by":"crossref","unstructured":"P. Hajnal and E. Szemer\u00e9di, Brooks coloring in parallel, SIAM J. Discrete Math., to appear.","DOI":"10.1137\/0403008"},{"issue":"1","key":"10.1016\/0304-3975(89)90121-7_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/0196-6774(88)90006-5","article-title":"A fast parallel algorithm to color a graph with \u0394 colors","volume":"9","author":"Karchmer","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(89)90121-7_BIB8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0196-6774(87)90026-5","article-title":"Efficient parallel algorithms for edge coloring problems","volume":"8","author":"Karloff","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(89)90121-7_BIB9","first-page":"266","article-title":"A fast parallel algorithm for the maximal independent set problem","author":"Karp","year":"1984","journal-title":"Proc. 16th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(89)90121-7_BIB10","first-page":"1","article-title":"A simple parallel algorithm for the maximal independent set problem","author":"Luby","year":"1985","journal-title":"Proc. 17th Ann. ACM Symp. on Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:56:17Z","timestamp":1555077377000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589901217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0304397589901217"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90121-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}