{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:49:09Z","timestamp":1787320149903,"version":"build-2736575974"},"reference-count":56,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","funder":[{"DOI":"10.13039\/501100001654","name":"German Academic Exchange Service London","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001654","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P020372\/1"],"award-info":[{"award-number":["EP\/P020372\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph problems. For general $m$-edge and $n$-vertex graphs, it is well known to be solvable in $O(m\\sqrt{n})$ time. We present a linear-time algorithm to find maximum-cardinality matchings on cocomparability graphs, a prominent subclass of perfect graphs that strictly contains interval graphs as well as permutation graphs. Our greedy algorithm is based on the recently discovered Lexicographic Depth First Search (LDFS).<\/jats:p>","DOI":"10.1137\/17m1120920","type":"journal-article","created":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T13:18:41Z","timestamp":1543929521000},"page":"2820-2835","source":"Crossref","is-referenced-by-count":7,"title":["A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs"],"prefix":"10.1137","volume":"32","author":[{"given":"George B.","family":"Mertzios","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,12,4]]},"reference":[{"key":"atypb1","first-page":"96","author":"Bentert M.","year":"2017","journal-title":"Berlin"},{"key":"atypb2","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, V. B. Le, and J. P. Spinrad,\n                      Graph Classes: A Survey\n                      , SIAM Monogr. Discrete Math. Appl. 3, SIAM, Philadelphia, 1999,https:\/\/doi.org\/10.1137\/1.9780898719796.","DOI":"10.1137\/1.9780898719796"},{"key":"atypb3","first-page":"146","author":"Chang M.","year":"1996","journal-title":"Berlin"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260205"},{"key":"atypb5","first-page":"267","author":"Corneil D.","year":"1987","journal-title":"Graph Theory and Computing"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1137\/11083856X"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1137\/15M1012396"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1137\/050623498"},{"key":"atypb9","first-page":"2765","author":"Coudert D.","year":"2018","journal-title":"Philadelphia"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00006-7"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791200375"},{"key":"atypb12","first-page":"184","author":"Dragan F. F.","year":"1997","journal-title":"Berlin"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1145\/2529989"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.07.016"},{"key":"atypb15","unstructured":"J. Dusart, M. Habib, and D. G. Corneil,\n                      Maximal Cliques Structure for Cocomparability Graphs and Applications\n                      , preprint,https:\/\/arxiv.org\/abs\/1611.02002, 2016."},{"key":"atypb16","first-page":"397","author":"Fluschnik T.","year":"2017","journal-title":"Berlin"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1145\/3186898"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90014-5"},{"key":"atypb19","first-page":"168","author":"Gardi F.","year":"2003","journal-title":"Berlin"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1137\/15M1039468"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.05.017"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0505-z"},{"key":"atypb23","doi-asserted-by":"crossref","unstructured":"M. C. Golumbic,\n                      Algorithmic Graph Theory and Perfect Graphs\n                      , 2nd ed., Ann. Discrete Math. 57, North-Holland, Amsterdam, 2004.","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.02.012"},{"key":"atypb26","first-page":"319","author":"K\u00f6hler E.","year":"2014","journal-title":"Berlin"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1137\/0406032"},{"key":"atypb28","first-page":"358","author":"Krawczyk T.","year":"2017","journal-title":"Berlin"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050088"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90117-R"},{"key":"atypb31","unstructured":"L. Lov\u00e1sz and M. D. Plummer,\n                      Matching Theory\n                      , Ann. Discrete Math. 29, North-Holland, Amsterdam, 1986."},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1034"},{"key":"atypb33","first-page":"253","author":"Madry A.","year":"2013","journal-title":"Washington, DC"},{"key":"atypb34","first-page":"536","author":"McConnell R. M.","year":"1994","journal-title":"Philadelphia"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.02.042"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9743-2"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1137\/140963108"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.03.023"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1137\/100793529"},{"key":"atypb40","unstructured":"G. B. Mertzios, A. Nichterlein, and R. Niedermeier,\n                      The power of linear-time data reduction for maximum matching\n                      , in Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS), 2017, 46."},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1137\/09075994X"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1137\/090780328"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.10.025"},{"key":"atypb44","first-page":"17","author":"Micali S.","year":"1980","journal-title":"Washington, DC"},{"key":"atypb45","first-page":"114","author":"Moitra A.","year":"1989","journal-title":"PA"},{"key":"atypb46","first-page":"248","author":"Mucha M.","year":"2004","journal-title":"Washington, DC"},{"key":"atypb47","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1187-5"},{"key":"atypb48","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90245-D"},{"key":"atypb49","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.028"},{"key":"atypb50","doi-asserted-by":"crossref","unstructured":"J. P. Spinrad,\n                      Efficient Graph Representations\n                      , Fields Inst. Monogr. 19, AMS, Providence, RI, 2003.","DOI":"10.1090\/fim\/019"},{"key":"atypb51","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(96)00079-X"},{"key":"atypb52","doi-asserted-by":"crossref","unstructured":"A. Takaoka,\n                      Graph isomorphism completeness for trapezoid graphs\n                      , IEICE Trans., 98-A (2015), pp. 1838-1840.","DOI":"10.1587\/transfun.E98.A.1838"},{"key":"atypb53","unstructured":"A. Takaoka,\n                      A Recognition Algorithm for Simple-Triangle Graphs\n                      , preprint,https:\/\/arxiv.org\/abs\/1710.06559, 2017."},{"key":"atypb54","doi-asserted-by":"crossref","unstructured":"A. Takaoka,\n                      Recognizing simple-triangle graphs by restricted 2-chain subgraph cover\n                      , in Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM), 2017, pp. 177-189.","DOI":"10.1007\/978-3-319-53925-6_14"},{"key":"atypb55","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90230-7"},{"key":"atypb56","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9625-7"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1120920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:54:14Z","timestamp":1787316854000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1120920"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":56,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1120920"],"URL":"https:\/\/doi.org\/10.1137\/17m1120920","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}