{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:28:03Z","timestamp":1752460083693},"reference-count":12,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":[[1997,6]]},"DOI":"10.1016\/s0020-0190(97)00082-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:36:00Z","timestamp":1051115760000},"page":"323-327","source":"Crossref","is-referenced-by-count":3,"title":["A parallel algorithm for solving the coloring problem on trapezoid graphs"],"prefix":"10.1016","volume":"62","author":[{"given":"Shin-ichi","family":"Nakayama","sequence":"first","affiliation":[]},{"given":"Shigeru","family":"Masuyama","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00082-3_BIB1","series-title":"Layout Design and Verification","first-page":"132","article-title":"Channel routing","author":"Burstein","year":"1986"},{"key":"10.1016\/S0020-0190(97)00082-3_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1980"},{"key":"10.1016\/S0020-0190(97)00082-3_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(88)90032-7","article-title":"Trapezoid graphs and their coloring","volume":"21","author":"Dagan","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(97)00082-3_BIB4","first-page":"143","article-title":"Trapezoid graphs and generalizations, geometry and algorithm","volume":"Vol. 824","author":"Felsner","year":"1994"},{"key":"10.1016\/S0020-0190(97)00082-3_BIB5","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0020-0190(97)00082-3_BIB6","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(97)00082-3_BIB7","series-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"key":"10.1016\/S0020-0190(97)00082-3_BIB8","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1992"},{"key":"10.1016\/S0020-0190(97)00082-3_BIB9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(90)90128-K","article-title":"A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle","volume":"34","author":"Kim","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00082-3_BIB10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2140\/pjm.1975.58.159","article-title":"Covering the vertices of a graph by vertex-disjoint path","volume":"58","author":"Noorvash","year":"1975","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0020-0190(97)00082-3_BIB11","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01990525","article-title":"Parallel algorithm for permutation graphs","volume":"33","author":"Yu","year":"1993","journal-title":"BIT"},{"key":"10.1016\/S0020-0190(97)00082-3_BIB12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0020-0190(93)90267-D","article-title":"A simple optimal parallel algorithm for the minimum coloring problem on interval graphs","volume":"48","author":"Yu","year":"1993","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000823?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000823?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:56:16Z","timestamp":1555145776000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097000823"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0020019097000823"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00082-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}