{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:40:30Z","timestamp":1648586430142},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1007\/bf01990526","type":"journal-article","created":{"date-parts":[[2005,8,4]],"date-time":"2005-08-04T14:55:06Z","timestamp":1123167306000},"page":"420-432","source":"Crossref","is-referenced-by-count":0,"title":["A linear time algorithm for the maximum matching problem on cographs"],"prefix":"10.1007","volume":"33","author":[{"given":"Ming-Shing","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Hsing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01990526_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","volume":"10","author":"K. Abrahamson","year":"1989","unstructured":"K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka,A simple parallel tree contraction algorithm, Journal of Algorithms, vol. 10, (1989), 287\u2013302.","journal-title":"Journal of Algorithms"},{"key":"BF01990526_CR2","unstructured":"G. S. Adhar and T. Peng,Parallel algorithms for path covering, Hamiltonian path, and Hamiltonian cycle in cographs, Proc. International Conference on Parallel Processing, (1990), III364\u2013III365."},{"key":"BF01990526_CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(91)90195-N","volume":"37","author":"H. Alt","year":"1991","unstructured":"H. Alt, N. Blum, K. Mehlhorn, and M. Paul,Computing a maximum cardinality matching in a bipartite graph in time O(n 1.5 \u221a(m\/logn)), Information Processing Letters, vol. 37, (1991), 237\u2013240.","journal-title":"Information Processing Letters"},{"key":"BF01990526_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D. G. Corneil","year":"1981","unstructured":"D. G. Corneil, H. Lerchs, and L. S. Burlingham,Complement reducible graphs, Discrete Appl. Math., vol. 3, (1981), 163\u2013174.","journal-title":"Discrete Appl. Math."},{"key":"BF01990526_CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"D. G. Corneil","year":"1984","unstructured":"D. G. Corneil and Y. Perl,Clustering and domination in perfect graphs, Discrete Appl. Math., vol. 9, (1984), 27\u201339.","journal-title":"Discrete Appl. Math."},{"key":"BF01990526_CR6","unstructured":"D. G. Corneil, Y. Perl, and L. K. Stewart,Cographs recognition, applications, and algorithms, Proceedings 15th Southeastern Conference on Combinatorics, Graph Theory and Computing, (1984)."},{"key":"BF01990526_CR7","doi-asserted-by":"crossref","unstructured":"S. Even and O. Kariv,An O(n 2.5)algorithm for matching in general graphs, Proc. 16th IEEE Symposium on Foundations of Computer Science, Berkeley, California, (1975), 100\u2013112.","DOI":"10.1109\/SFCS.1975.5"},{"key":"BF01990526_CR8","volume-title":"The Art of Computer Programming, Vol. 1.Fundamental Algorithms","author":"D. Knuth","year":"1968","unstructured":"D. Knuth,The Art of Computer Programming, Vol. 1.Fundamental Algorithms, Addison-Wesley, Reading, MA, (1968)."},{"key":"BF01990526_CR9","unstructured":"A. Moitra and R. C. Johnson,A parallel algorithm for maximum matching in interval graphs, Proc. International Conference on Parallel Processing, (1989), III114\u2013III120."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01990526.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01990526\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01990526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T17:20:07Z","timestamp":1586366407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01990526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF01990526"],"URL":"https:\/\/doi.org\/10.1007\/bf01990526","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}