{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:40:13Z","timestamp":1725622813044},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"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":[[1989,11]]},"DOI":"10.1016\/0020-0190(89)90195-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:20:15Z","timestamp":1027642815000},"page":"147-156","source":"Crossref","is-referenced-by-count":20,"title":["Optimal parallel algorithms on circular-arc graphs"],"prefix":"10.1016","volume":"33","author":[{"given":"A.Srinivasa","family":"Rao","sequence":"first","affiliation":[]},{"given":"C.Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90195-6_BIB1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(87)90007-X","article-title":"Finding maximum cliques on circular-arc graphs","volume":"26","author":"Apostolico","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90195-6_BIB2","series-title":"Tech. Rept. CSDTR-813","article-title":"Optimal parallel algorithm for the minimum circle-cover problem","author":"Atallah","year":"1988"},{"key":"10.1016\/0020-0190(89)90195-6_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."},{"key":"10.1016\/0020-0190(89)90195-6_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."},{"key":"10.1016\/0020-0190(89)90195-6_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Gary","year":"1979"},{"key":"10.1016\/0020-0190(89)90195-6_BIB6","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbio","year":"1980"},{"key":"10.1016\/0020-0190(89)90195-6_BIB7","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/0196-6774(88)90023-5","article-title":"Stability in circular-arc graphs","volume":"9","author":"Golumbic","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(89)90195-6_BIB8","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/0214018","article-title":"Maximum weight clique algorithms for circular-arc graphs and circle graphs","volume":"14","author":"Hsu","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(89)90195-6_BIB9","author":"Hsu","year":"1988","journal-title":"Linear algorithms on circular-arc graphs"},{"key":"10.1016\/0020-0190(89)90195-6_BIB10","first-page":"150","article-title":"Efficient parallel algorithms for chordal graphs","author":"Klein","year":"1988","journal-title":"Proc. 29th FOCS"},{"key":"10.1016\/0020-0190(89)90195-6_BIB11","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0022-0000(88)90006-2","article-title":"An efficient parallel algorithm for planarity","volume":"37","author":"Klein","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(89)90195-6_BIB12","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"24","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(89)90195-6_BIB13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0217003","article-title":"An optimal algorithm for finding a maximum independent set of a circular-arc graph","volume":"17","author":"Masuda","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(89)90195-6_BIB14","series-title":"Discrete Mathematical Models, with Applications to Social, Biological and Environmental Problems","author":"Roberts","year":"1976"},{"key":"10.1016\/0020-0190(89)90195-6_BIB15","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(89)90195-6_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0209001","article-title":"An efficient test for circular-arc graphs","volume":"9","author":"Tucker","year":"1980","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901956?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901956?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:53:59Z","timestamp":1555059239000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089901956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,11]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,11]]}},"alternative-id":["0020019089901956"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90195-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,11]]}}}