{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:08:35Z","timestamp":1648829315356},"reference-count":13,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":[[1990,5]]},"DOI":"10.1016\/0020-0190(90)90128-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"235-241","source":"Crossref","is-referenced-by-count":3,"title":["A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle"],"prefix":"10.1016","volume":"34","author":[{"given":"Sung Kwon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90128-K_BIB1","first-page":"497","article-title":"Notes on searching in multidimensional monotone arrays","author":"Aggarwal","year":"1988","journal-title":"Proc. IEEE Symp. on Foundation of Computer Science"},{"key":"10.1016\/0020-0190(90)90128-K_BIB2","first-page":"253","article-title":"Efficient parallel algorithms for string editing and related problems","author":"Apostolic","year":"1988","journal-title":"Proc. Annual Allerton Conference on Communication, Control and Computing"},{"key":"10.1016\/0020-0190(90)90128-K_BIB3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(87)90007-X","article-title":"Finding maximum cliques in circular-arc graphs","volume":"26","author":"Apostolic","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(90)90128-K_BIB4","first-page":"1","article-title":"Parallel algorithms for evaluating sequences of set-manipulation operations","volume":"319","author":"Atallah","year":"1988"},{"key":"10.1016\/0020-0190(90)90128-K_BIB5","author":"Bondy","year":"1976"},{"key":"10.1016\/0020-0190(90)90128-K_BIB6","first-page":"1","article-title":"Matrix multiplication via arithmetic progression","author":"Coppersmith","year":"1987","journal-title":"Proc. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(90)90128-K_BIB7","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(90)90128-K_BIB8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(88)90164-0","article-title":"An improved parallel algorithm that computes the BFS numbering of a directed graph","volume":"28","author":"Gazit","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(90)90128-K_BIB9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An nsol52 algorithm for maximum matching in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(90)90128-K_BIB10","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(90)90128-K_BIB11","first-page":"91","article-title":"Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms","author":"Leighton","year":"1986","journal-title":"Proc. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(90)90128-K_BIB12","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 linear space","volume":"6","author":"Emde Boas","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(90)90128-K_BIB13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","article-title":"Design and implementation of an efficient priority queue","volume":"10","author":"Emde Boas","year":"1977","journal-title":"Math. Systems Theory"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090128K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090128K?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:59:12Z","timestamp":1555088352000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090128K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["002001909090128K"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90128-k","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}