{"id":"https://openalex.org/W2605350614","doi":"https://doi.org/10.1137/17m1120920","title":"A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs","display_name":"A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2605350614","doi":"https://doi.org/10.1137/17m1120920","mag":"2605350614"},"language":"en","primary_location":{"id":"doi:10.1137/17m1120920","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1120920","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1703.05598","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018078197","display_name":"George B. Mertzios","orcid":"https://orcid.org/0000-0001-7182-585X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"George B. Mertzios","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012560459","display_name":"Andr\u00e9 Nichterlein","orcid":"https://orcid.org/0000-0001-7451-9401"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Nichterlein","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033021388","display_name":"Rolf Niedermeier","orcid":"https://orcid.org/0000-0003-1703-1236"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rolf Niedermeier","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5691,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67482714,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"32","issue":"4","first_page":"2820","last_page":"2835"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8133057355880737},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.7034766674041748},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.7009242177009583},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6090367436408997},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.5694608092308044},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5652668476104736},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5574326515197754},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5395322442054749},{"id":"https://openalex.org/keywords/permutation-graph","display_name":"Permutation graph","score":0.5313542485237122},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5112314224243164},{"id":"https://openalex.org/keywords/trapezoid-graph","display_name":"Trapezoid graph","score":0.48686307668685913},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.47155261039733887},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.46889418363571167},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.43502703309059143},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4290083646774292},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.4181153476238251},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.41786688566207886},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4142223000526428},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4134540557861328},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3780728876590729},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34816840291023254},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22831189632415771},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.22721338272094727}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8133057355880737},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.7034766674041748},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7009242177009583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6090367436408997},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.5694608092308044},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5652668476104736},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5574326515197754},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5395322442054749},{"id":"https://openalex.org/C68965932","wikidata":"https://www.wikidata.org/wiki/Q7169369","display_name":"Permutation graph","level":3,"score":0.5313542485237122},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5112314224243164},{"id":"https://openalex.org/C10325715","wikidata":"https://www.wikidata.org/wiki/Q7835582","display_name":"Trapezoid graph","level":5,"score":0.48686307668685913},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47155261039733887},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.46889418363571167},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.43502703309059143},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4290083646774292},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4181153476238251},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.41786688566207886},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4142223000526428},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4134540557861328},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3780728876590729},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34816840291023254},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22831189632415771},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.22721338272094727},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/17m1120920","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1120920","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:26442","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/26442/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"SIAM journal on discrete mathematics, 2018, Vol.32(4), pp.2820-2835 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:arXiv.org:1703.05598","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1703.05598","pdf_url":"https://arxiv.org/pdf/1703.05598","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2605350614","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1703.05598","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:durham-repository.worktribe.com:1317406","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1317406","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},{"id":"doi:10.48550/arxiv.1703.05598","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1703.05598","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1703.05598","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1703.05598","pdf_url":"https://arxiv.org/pdf/1703.05598","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6214505137","display_name":null,"funder_award_id":"EP/K022660/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6811041424","display_name":"Algorithmic Aspects of Temporal Graphs","funder_award_id":"EP/P020372/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G967227458","display_name":null,"funder_award_id":"EP/P020372/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320664","display_name":"Durham University","ror":"https://ror.org/01v29qb04"},{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320334761","display_name":"German Academic Exchange Service London","ror":"https://ror.org/039djdh30"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W35758821","https://openalex.org/W1494735819","https://openalex.org/W1579049696","https://openalex.org/W1591789561","https://openalex.org/W1813313303","https://openalex.org/W1854376577","https://openalex.org/W1954157972","https://openalex.org/W1966596093","https://openalex.org/W1972965975","https://openalex.org/W1986137691","https://openalex.org/W1999848117","https://openalex.org/W2015475193","https://openalex.org/W2028503265","https://openalex.org/W2033410225","https://openalex.org/W2047281923","https://openalex.org/W2058848621","https://openalex.org/W2065295938","https://openalex.org/W2065410741","https://openalex.org/W2068928748","https://openalex.org/W2069133957","https://openalex.org/W2076736619","https://openalex.org/W2080222130","https://openalex.org/W2083197082","https://openalex.org/W2094742636","https://openalex.org/W2108763491","https://openalex.org/W2125673636","https://openalex.org/W2127787106","https://openalex.org/W2130257319","https://openalex.org/W2130950293","https://openalex.org/W2143474538","https://openalex.org/W2144795927","https://openalex.org/W2151719453","https://openalex.org/W2157529519","https://openalex.org/W2166017939","https://openalex.org/W2193295754","https://openalex.org/W2317521099","https://openalex.org/W2408404065","https://openalex.org/W2588864806","https://openalex.org/W2592125861","https://openalex.org/W2617953066","https://openalex.org/W2765921917","https://openalex.org/W2766187413","https://openalex.org/W2772612740","https://openalex.org/W2949741977","https://openalex.org/W2951185106","https://openalex.org/W2962815948","https://openalex.org/W2962968573","https://openalex.org/W2963005395","https://openalex.org/W2963060183","https://openalex.org/W3135965400","https://openalex.org/W4230551286"],"related_works":["https://openalex.org/W2964074136","https://openalex.org/W2106934213","https://openalex.org/W2131735508","https://openalex.org/W2002065932","https://openalex.org/W77483341","https://openalex.org/W2607123191","https://openalex.org/W138944661","https://openalex.org/W2241883042","https://openalex.org/W2950742669","https://openalex.org/W2293112721","https://openalex.org/W2095912437","https://openalex.org/W1487038674","https://openalex.org/W2014290730","https://openalex.org/W2157529519","https://openalex.org/W3030295680","https://openalex.org/W1605544347","https://openalex.org/W2964101972","https://openalex.org/W2960749100","https://openalex.org/W3118553797","https://openalex.org/W1578113210"],"abstract_inverted_index":{"Finding":[0],"maximum-cardinality":[1,38],"matchings":[2,39],"in":[3,28],"undirected":[4],"graphs":[5,48,53],"is":[6,22,62],"arguably":[7],"one":[8],"of":[9,46],"the":[10,65],"most":[11],"central":[12],"graph":[13],"problems.":[14],"For":[15],"general":[16],"$m$-edge":[17],"and":[18],"$n$-vertex":[19],"graphs,":[20,42],"it":[21],"well":[23,55],"known":[24],"to":[25,36],"be":[26],"solvable":[27],"$O(m\\sqrt{n})$":[29],"time.":[30],"We":[31],"present":[32],"a":[33,43],"linear-time":[34],"algorithm":[35,61],"find":[37],"on":[40,64],"cocomparability":[41],"prominent":[44],"subclass":[45],"perfect":[47],"that":[49],"strictly":[50],"contains":[51],"interval":[52],"as":[54,56],"permutation":[57],"graphs.":[58],"Our":[59],"greedy":[60],"based":[63],"recently":[66],"discovered":[67],"Lexicographic":[68],"Depth":[69],"First":[70],"Search":[71],"(LDFS).":[72]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2022-10-01T00:00:00"}