{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:14:50Z","timestamp":1767212090247},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"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":[[1995,11]]},"DOI":"10.1016\/0020-0190(95)00145-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:02:51Z","timestamp":1027634571000},"page":"215-219","source":"Crossref","is-referenced-by-count":30,"title":["Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits"],"prefix":"10.1016","volume":"56","author":[{"given":"Y.Daniel","family":"Liang","sequence":"first","affiliation":[]},{"given":"Norbert","family":"Blum","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00145-3_BIB1","first-page":"73","article-title":"NP-completeness of the Hamiltonian cycle problem for bipartite graphs","volume":"3","author":"Akiyama","year":"1980","journal-title":"J. Inform. Process."},{"key":"10.1016\/0020-0190(95)00145-3_BIB2","first-page":"842","article-title":"Two theorems in graph theory","volume":"43","author":"Berge","year":"1957"},{"key":"10.1016\/0020-0190(95)00145-3_BIB3","unstructured":"M.-S. Chang, Private communications, 1993."},{"key":"10.1016\/0020-0190(95)00145-3_BIB4","article-title":"Fast turing reduction between problems in NP, Chapter 4: Reduction between NP-complete problems","author":"Dewdney","year":"1983"},{"key":"10.1016\/0020-0190(95)00145-3_BIB5","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."},{"key":"10.1016\/0020-0190(95)00145-3_BIB6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(95)00145-3_BIB7","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(95)00145-3_BIB8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/nav.3800140304","article-title":"Maximum matching in convex bipartite graphs","volume":"14","author":"Glover","year":"1967","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0020-0190(95)00145-3_BIB9","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(95)00145-3_BIB10","series-title":"Proc. Southeast ACM Conf.","first-page":"15","article-title":"A linear algorithm for Hamiltonian circuits in circular-arc graphs","author":"Liang","year":"1994"},{"key":"10.1016\/0020-0190(95)00145-3_BIB11","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF00264533","article-title":"Efficient algorithms for finding maximum matching in convex bipartite graphs and related problems","volume":"15","author":"Lipski","year":"1981","journal-title":"Acta Inform."},{"issue":"6","key":"10.1016\/0020-0190(95)00145-3_BIB12","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1137\/0221061","article-title":"An O(n2 log n) algorithm for Hamiltonian cycle problem on circular-arc graphs","volume":"21","author":"Shih","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(95)00145-3_BIB13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095001453?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095001453?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T22:59:00Z","timestamp":1555282740000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019095001453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["0020019095001453"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00145-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}