{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T14:16:17Z","timestamp":1773584177634,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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,5]]},"DOI":"10.1016\/0020-0190(89)90220-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"129-134","source":"Crossref","is-referenced-by-count":17,"title":["An O(n log n + m log log n) maximum weight clique algorithm for circular-arc graphs"],"prefix":"10.1016","volume":"31","author":[{"given":"Wei-Kuan","family":"Shih","sequence":"first","affiliation":[]},{"given":"Wen-Lian","family":"Hsu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0020-0190(89)90220-2_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)90220-2_BIB2","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230040407","article-title":"Algorithms on circular-arc graphs","volume":"4","author":"Gavril","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0020-0190(89)90220-2_BIB3","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(89)90220-2_BIB4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0012-365X(85)90039-1","article-title":"Interval graphs and related topics","volume":"55","author":"Golumbic","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(89)90220-2_BIB5","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)90220-2_BIB6","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(89)90220-2_BIB7","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)90220-2_BIB8","doi-asserted-by":"crossref","first-page":"810","DOI":"10.2307\/2317880","article-title":"What are the intersection graphs of arcs in a circle?","volume":"76","author":"Klee","year":"1969","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0020-0190(89)90220-2_BIB9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0217003","article-title":"An optimal algorithm for finding a maximum in circular-arc graphs","volume":"17","author":"Masuda","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(89)90220-2_BIB10","series-title":"Graph Theory and its Applications to Problems of Society","author":"Roberts","year":"1978"},{"key":"10.1016\/0020-0190(89)90220-2_BIB11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0041-1647(68)90016-6","article-title":"Scheduling of traffic lights\u2014A new approach","volume":"2","author":"Stouffers","year":"1968","journal-title":"Transportation Res."},{"key":"10.1016\/0020-0190(89)90220-2_BIB12","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/S0012-365X(76)80011-8","article-title":"Characterization problems for graphs, partially ordered sets, lattice, and families of sets","volume":"16","author":"Trotter","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(89)90220-2_BIB13","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0129040","article-title":"Coloring a family of circular-arc graphs","volume":"29","author":"Tucker","year":"1975","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0020-0190(89)90220-2_BIB14","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."},{"issue":"3","key":"10.1016\/0020-0190(89)90220-2_BIB15","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","article-title":"Preserving order in a forest in less than logarithmic time and linear space","volume":"6","author":"Van Emde Boas","year":"1977","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089902202?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089902202?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:56:13Z","timestamp":1555088173000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089902202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0020019089902202"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90220-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}