{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T17:08:34Z","timestamp":1649092114701},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1995,8]]},"DOI":"10.1007\/bf01178659","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T19:41:53Z","timestamp":1108669313000},"page":"779-792","source":"Crossref","is-referenced-by-count":1,"title":["Finding a maximum matching in a permutation graph"],"prefix":"10.1007","volume":"32","author":[{"given":"Chongkye","family":"Rhee","sequence":"first","affiliation":[]},{"given":"Y. Daniel","family":"Liang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01178659_CR1","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"C. Berge: Two theorems in graph theory. Proceeding of National Academy of Science43 (1957) 842\u2013844","journal-title":"Proceeding of National Academy of Science"},{"key":"BF01178659_CR2","first-page":"449","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds: Paths, trees and flowers. Canadian J.17 (1965) 449\u2013467","journal-title":"Canadian J."},{"key":"BF01178659_CR3","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"P. van Emde Boas: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters6 (1977) 80\u201382","journal-title":"Information Processing Letters"},{"key":"BF01178659_CR4","unstructured":"S. Even, O. Kariv: AnO(n 2.5) algorithm for finding maximum matching in general graphs. Proceeding of 16th IEEE Sympo. on Foundations of Computer Science (1975) 100\u2013112"},{"key":"BF01178659_CR5","unstructured":"H. Gabow: An efficient implementation of Edmonds' maximum matching algorithm. TR 31, Stan-CS (1972) 72\u2013328"},{"key":"BF01178659_CR6","volume-title":"Algorithmic graph theory and perfect graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic: Algorithmic graph theory and perfect graphs. Academic Press, New York, 1980"},{"key":"BF01178659_CR7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"M.C. Hopcroft","year":"1973","unstructured":"M.C. Hopcroft, R.M. Karp: AnO(n 2.5) algorithm for maximum matching in bipartite graphs. SIAM J. on Computing2 (1973) 225\u2013231","journal-title":"SIAM J. on Computing"},{"key":"BF01178659_CR8","unstructured":"V. Kamakoti, C. Pandu Rangan: Efficient transitive reduction on permutation graphs with applications. SCI J. of Computer Science and Informatics (INDIA, 1994)"},{"key":"BF01178659_CR9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(93)90117-R","volume":"45","author":"Y. Liang","year":"1993","unstructured":"Y. Liang, C. Rhee: Finding a maximum matching in a circular-arc graph. Information Processing Letters45 (1993) 185\u2013190","journal-title":"Information Processing Letters"},{"key":"BF01178659_CR10","doi-asserted-by":"crossref","unstructured":"S. Micali, V. Vazirani: AnO(\u221anm) algorithm for finding maximum matching in general graphs. 21th Annual IEEE Sympo. on the Foundations of Software Technology and Theoretical Computer Science (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"BF01178659_CR11","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","volume":"23","author":"A. Pnueli","year":"1971","unstructured":"A. Pnueli, A. Lempel, S. Even: Transitive orientation of graphs and identification of permutation graphs. Can. J. Math.23 (1971) 160\u2013175","journal-title":"Can. J. Math."},{"key":"BF01178659_CR12","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0214048","volume":"14","author":"J. Spinrad","year":"1985","unstructured":"J. Spinrad: On comparability and permutation graphs. SIAM J. Computing14 (1985) 658\u2013670","journal-title":"SIAM J. Computing"},{"key":"BF01178659_CR13","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(93)90230-7","volume":"47","author":"M.S. Yu","year":"1993","unstructured":"M.S. Yu, C.H. Yang: AnO(n) time algorithm for maximum matching on cographs. Information Processing Letters47 (1993) 89\u201393","journal-title":"Information Processing Letters"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178659.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01178659\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178659","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:29:24Z","timestamp":1586118564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01178659"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":13,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["BF01178659"],"URL":"https:\/\/doi.org\/10.1007\/bf01178659","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}