{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:38:49Z","timestamp":1648679929472},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":[[1996,3]]},"DOI":"10.1016\/0020-0190(95)00206-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:21:21Z","timestamp":1027621281000},"page":"287-290","source":"Crossref","is-referenced-by-count":2,"title":["An NC algorithm for the clique cover problem in cocomparability graphs and its application"],"prefix":"10.1016","volume":"57","author":[{"given":"Chongkye","family":"Rhee","sequence":"first","affiliation":[]},{"given":"Y.Daniel","family":"Liang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00206-5_BIB1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0020-0190(95)00206-5_BIB2","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(95)00206-5_BIB3","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1006\/jagm.1993.1042","article-title":"Parallel algorithm for cograph recognition with application","volume":"15","author":"Xin","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(95)00206-5_BIB4","series-title":"International Conference on Parallel Processing","first-page":"853","article-title":"Perfect Graphs and Parallel Algorithms","author":"Helmbold","year":"1986"},{"key":"10.1016\/0020-0190(95)00206-5_BIB5","series-title":"Proc. 26th IEEE FOCS","first-page":"14","article-title":"Parallel algorithms for shortest path problems","author":"Paige","year":"1985"},{"key":"10.1016\/0020-0190(95)00206-5_BIB6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0020-0190(94)90053-1","article-title":"Efficient algorithms for finding depthfirst and breadthfirst search trees in permutation graphs","volume":"49","author":"Rhee","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00206-5_BIB7","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0214048","article-title":"On comparability and permutation graphs","volume":"14","author":"Spinrad","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095002065?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095002065?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:23:19Z","timestamp":1556058199000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019095002065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0020019095002065"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00206-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}