{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:07:22Z","timestamp":1761620842908},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1990,2]]},"DOI":"10.1016\/0167-8191(90)90152-y","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"253-256","source":"Crossref","is-referenced-by-count":7,"title":["A parallel algorithm for finding a maximum weight clique of an interval graph"],"prefix":"10.1016","volume":"13","author":[{"given":"Chii-Huah","family":"Shyu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0167-8191(90)90152-Y_BIB1"},{"key":"10.1016\/0167-8191(90)90152-Y_BIB2","first-page":"307","article-title":"Sorting network and their applications","volume":"32","author":"Batcher","year":"1968"},{"key":"10.1016\/0167-8191(90)90152-Y_BIB3","first-page":"1607","article-title":"On the topology of the genetic fine structure","volume":"45","author":"Benzer","year":"1959"},{"key":"10.1016\/0167-8191(90)90152-Y_BIB4","first-page":"335","article-title":"Testing for consecutive ones property: Interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0167-8191(90)90152-Y_BIB5","series-title":"Proc. 27th IEEE Found. of Comput. Sci.","first-page":"511","article-title":"Parallel merge sort","author":"Cole","year":"1986"},{"key":"10.1016\/0167-8191(90)90152-Y_BIB6","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TC.1983.1676223","article-title":"Binary trees and parallel scheduling algorithms","volume":"32","author":"Dekel","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90152-Y_BIB7","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/0167-8191(90)90152-Y_BIB8","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs and of interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/0167-8191(90)90152-Y_BIB9","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","article-title":"Efficient algorithms for interval and circular-arc graphs","volume":"12","author":"Gupta","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0167-8191(90)90152-Y_BIB10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","article-title":"Representation of a finite graph by a set of intervals on the real line","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fund. Math."},{"key":"10.1016\/0167-8191(90)90152-Y_BIB11","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0196-6774(84)90037-3","article-title":"Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs","volume":"5","author":"Leung","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0167-8191(90)90152-Y_BIB12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/322123.322125","article-title":"A linear time algorithm for deciding interval graph isomorphism","volume":"26","author":"Lueker","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"year":"1987","series-title":"Parallel Complexity Theory","author":"Parberry","key":"10.1016\/0167-8191(90)90152-Y_BIB13"},{"year":"1976","series-title":"Discrete Mathematical Models","author":"Roberts","key":"10.1016\/0167-8191(90)90152-Y_BIB14"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090152Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090152Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:25:28Z","timestamp":1551086728000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090152Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["016781919090152Y"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90152-y","relation":{},"ISSN":["0167-8191"],"issn-type":[{"type":"print","value":"0167-8191"}],"subject":[],"published":{"date-parts":[[1990,2]]}}}