{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:34:03Z","timestamp":1757615643187,"version":"3.44.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0020-0190(94)90104-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"303-308","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees"],"prefix":"10.1016","volume":"49","author":[{"given":"G.","family":"Sajith","sequence":"first","affiliation":[]},{"given":"Sanjeev","family":"Saxena","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90104-X_BIB1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(92)90271-G","article-title":"Data-movement-intensive problems: two folk theorems in parallel computation revisited","volume":"95","author":"Akl","year":"1992","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"10.1016\/0020-0190(94)90104-X_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\/0020-0190(94)90104-X_BIB3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0890-5401(91)90031-V","article-title":"Improved deterministic parallel integer sorting","volume":"94","author":"Bhatt","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(94)90104-X_BIB4","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0890-5401(89)90036-9","article-title":"Faster optimal parallel prefix sums and list ranking","volume":"81","author":"Cole","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(94)90104-X_BIB5","first-page":"205","article-title":"Parallel processing for efficient subdivision search","author":"Dadoun","year":"1987","journal-title":"Proc. ACM Symp. Computational Geometry"},{"key":"10.1016\/0020-0190(94)90104-X_BIB6","first-page":"315","article-title":"Parallel symmetry breaking in sparse graphs","author":"Goldberg","year":"1987","journal-title":"Proc. 19th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)90104-X_BIB7","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(94)90104-X_BIB8","doi-asserted-by":"crossref","unstructured":"Y. Han, Matching partition a linked list and its optimization, SPAA 89, 246-253.","DOI":"10.1145\/72935.72961"},{"key":"10.1016\/0020-0190(94)90104-X_BIB9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(92)90045-W","article-title":"Optimal parallel 3-coloring for rooted trees and applications","volume":"41","author":"Rajc\u0306\u00e1ni","year":"1992","journal-title":"Inform. Process. Letters"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909490104X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909490104X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T14:58:47Z","timestamp":1757084327000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909490104X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["002001909490104X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90104-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1994,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(94)90104-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1994 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}