{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:13Z","timestamp":1770994093016,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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":[[1993,3]]},"DOI":"10.1016\/0020-0190(93)90117-r","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"185-190","source":"Crossref","is-referenced-by-count":12,"title":["Finding a maximum matching in a circular-arc graph"],"prefix":"10.1016","volume":"45","author":[{"given":"Y.Daniel","family":"Liang","sequence":"first","affiliation":[]},{"given":"Chongkye","family":"Rhee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90117-R_BIB1","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","article-title":"Two theorems in graph theory","volume":"43","author":"Berge","year":"1957","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"10.1016\/0020-0190(93)90117-R_BIB2","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(93)90117-R_BIB3","first-page":"100","article-title":"An O(n2.5) algorithm for finding maximum matching in general graphs","author":"Even","year":"1975","journal-title":"Proc. 16th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90117-R_BIB4","first-page":"72","article-title":"An efficient implementation of Edmonds' maximum matching algorithm","author":"Gabow","year":"1972","journal-title":"Tech. Rept. TR 31"},{"key":"10.1016\/0020-0190(93)90117-R_BIB5","first-page":"853","article-title":"Perfect graphs and parallel algorithms","author":"Helmbod","year":"1986","journal-title":"Proc. 1986 Internat. Conf. on Parallel Processing"},{"key":"10.1016\/0020-0190(93)90117-R_BIB6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An O(n2.5) algorithm for maximum matching in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(93)90117-R_BIB7","first-page":"496","article-title":"NC algorithms for comparability graphs, interval graphs and unique perfect matchings","volume":"206","author":"Kozen","year":"1988"},{"key":"10.1016\/0020-0190(93)90117-R_BIB8","first-page":"17","article-title":"An O(\u221a|V||E|) algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980","journal-title":"Proc. 21th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90117-R_BIB9","series-title":"Tech. Rept. TR 88-927","article-title":"Parallel algorithms for maximum matching and other problems on interval graphs","author":"Moitra","year":"1988"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390117R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390117R?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:26:29Z","timestamp":1555143989000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390117R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["002001909390117R"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90117-r","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}