{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T16:20:10Z","timestamp":1784564410392,"version":"3.55.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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,8]]},"DOI":"10.1016\/0020-0190(93)90230-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"89-93","source":"Crossref","is-referenced-by-count":16,"title":["An O(n) time algorithm for maximum matching on cographs"],"prefix":"10.1016","volume":"47","author":[{"given":"Ming-Shing","family":"Yu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cheng-Hsing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90230-7_BIB1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","article-title":"A simple parallel tree contraction algorithm","volume":"10","author":"Abrahamson","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(93)90230-7_BIB2","first-page":"364","article-title":"Parallel algorithms for path covering, Hamiltonian path, and Hamiltonian cycle in cographs","volume":"Vol. III","author":"Adhar","year":"1990","journal-title":"Proc. Internat. Conf. on Parallel Processing"},{"key":"10.1016\/0020-0190(93)90230-7_BIB3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(91)90195-N","article-title":"Computing a maximum cardinality matching in a bipartite graph in time O(n1.5 \u221am\/log n)","volume":"37","author":"Alt","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90230-7_BIB4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(93)90230-7_BIB5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","article-title":"Clustering and domination in perfect graphs","volume":"9","author":"Corneil","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(93)90230-7_BIB6","article-title":"Cographs: recognition, applications, and algorithms","author":"Corneil","year":"1984","journal-title":"Proc. 15th Southeastern Conf. on Combinatorics, Graph Theory and Computing"},{"key":"10.1016\/0020-0190(93)90230-7_BIB7","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(93)90230-7_BIB8","first-page":"100","article-title":"An O(n2.5) algorithm for 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)90230-7_BIB9","series-title":"The Art of Computer Programming. Vol. 1. Fundamental Algorithms","author":"Knuth","year":"1968"},{"key":"10.1016\/0020-0190(93)90230-7_BIB10","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1137\/0215002","article-title":"An amortized analysis of insertions into AVL-trees","volume":"15","author":"Mehlhorn","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(93)90230-7_BIB11","first-page":"114","article-title":"A parallel algorithm for maximum matching in interval graphs","volume":"Vol. III","author":"Moitra","year":"1989","journal-title":"Proc. Internat. Conf. on Parallel Processing"},{"issue":"2","key":"10.1016\/0020-0190(93)90230-7_BIB12","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093902307?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093902307?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:41Z","timestamp":1555129661000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019093902307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["0020019093902307"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90230-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}