{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:57:24Z","timestamp":1770325044580,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"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":[[1991,11]]},"DOI":"10.1016\/0020-0190(91)90165-e","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"123-129","source":"Crossref","is-referenced-by-count":68,"title":["Linear time algorithms on circular-arc graphs"],"prefix":"10.1016","volume":"40","author":[{"given":"Wen-Lian","family":"Hsu","sequence":"first","affiliation":[]},{"given":"Kuo-Hui","family":"Tsai","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90165-E_BIB1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0166-218X(85)90025-3","article-title":"Dominating sets and domatic number of circular-arc graphs","volume":"12","author":"Bonuccelli","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(91)90165-E_BIB2","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(91)90165-E_BIB3","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","article-title":"Efficient algorithms for interval graphs and circular-arc graphs","volume":"12","author":"Gupta","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0020-0190(91)90165-E_BIB4","first-page":"842","article-title":"Linear time algorithms on circular-arc graphs","author":"Hsu","year":"1988","journal-title":"Proc. 26th Ann. Allerton Conf."},{"key":"10.1016\/0020-0190(91)90165-E_BIB5","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(91)90165-E_BIB6","series-title":"Ph.D. Dissertation","article-title":"Parallel algorithms for special graphs","author":"Rhee","year":"1990"},{"key":"10.1016\/0020-0190(91)90165-E_BIB7","first-page":"3","article-title":"Optimal algorithms for the minimum dominating set problem on circular-arc graphs","author":"Yu","year":"1989","journal-title":"Proc. First Ann. IEEE Symp. on Parallel and Distributed Computing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190165E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190165E?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:25:29Z","timestamp":1555143929000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190165E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["002001909190165E"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90165-e","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}