{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:34:49Z","timestamp":1742391289465},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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":[[1993,10]]},"DOI":"10.1016\/0020-0190(93)90267-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"47-51","source":"Crossref","is-referenced-by-count":3,"title":["A simple optimal parallel algorithm for the minimum coloring problem on interval graphs"],"prefix":"10.1016","volume":"48","author":[{"given":"Ming-Shing","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Hsing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(93)90267-D_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"Sorting in c log n steps","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(93)90267-D_BIB2","series-title":"Design and Analysis of Parallel Algorithms","author":"Akl","year":"1989"},{"issue":"4","key":"10.1016\/0020-0190(93)90267-D_BIB3","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0020-0190(93)90267-D_BIB4","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","article-title":"Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0020-0190(93)90267-D_BIB5","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/opre.31.1.24","article-title":"Parallel scheduling algorithms","volume":"31","author":"Dekel","year":"1983","journal-title":"Oper. Res."},{"key":"10.1016\/0020-0190(93)90267-D_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"2","key":"10.1016\/0020-0190(93)90267-D_BIB7","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","article-title":"The complexity of coloring circular arcs and chords","volume":"1","author":"Garey","year":"1980","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0020-0190(93)90267-D_BIB8","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"issue":"11","key":"10.1016\/0020-0190(93)90267-D_BIB9","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1109\/TC.1979.1675260","article-title":"An optimal solution for the channel-assignment problem","volume":"28","author":"Gupta","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"10.1016\/0020-0190(93)90267-D_BIB10","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","article-title":"The power of parallel prefix","volume":"34","author":"Kruskal","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0020-0190(93)90267-D_BIB11","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0190(93)90267-D_BIB12","series-title":"Graph Theory and Its Applications to Problems of Society","author":"Roberts","year":"1978"},{"key":"10.1016\/0020-0190(93)90267-D_BIB13","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-50728-0_52","article-title":"A parallel algorithm for channel routing","volume":"344","author":"Savage","year":"1989","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0020-0190(93)90267-D_BIB14","first-page":"III162","article-title":"An optimal parallel algorithm for minimum coloring of intervals","author":"Yu","year":"1990","journal-title":"Proc. Internat. Conf. on Parallel Processing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390267D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390267D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:28:23Z","timestamp":1555144103000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390267D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["002001909390267D"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90267-d","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}