{"id":"https://openalex.org/W2596114558","doi":"https://doi.org/10.1007/s00453-020-00736-0","title":"The Power of Linear-Time Data Reduction for Maximum Matching","display_name":"The Power of Linear-Time Data Reduction for Maximum Matching","publication_year":2020,"publication_date":"2020-07-06","ids":{"openalex":"https://openalex.org/W2596114558","doi":"https://doi.org/10.1007/s00453-020-00736-0","mag":"2596114558"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-020-00736-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-020-00736-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00736-0.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00736-0.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"George B. Mertzios","orcid":"https://orcid.org/0000-0001-7182-585X"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"George B. Mertzios","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, UK"],"raw_orcid":"https://orcid.org/0000-0001-7182-585X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Andr\u00e9 Nichterlein","orcid":"https://orcid.org/0000-0001-7451-9401"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andr\u00e9 Nichterlein","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0001-7451-9401","affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":null,"display_name":"Rolf Niedermeier","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Niedermeier","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.769,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.69674357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"82","issue":"12","first_page":"3521","last_page":"3565"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.8348000049591064,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.8348000049591064,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.051600001752376556,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.015300000086426735,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/bipartite-graph","display_name":"Bipartite graph","score":0.7795000076293945},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.7027999758720398},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6158999800682068},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5885999798774719},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5095000267028809},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4528000056743622},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.430400013923645},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.382099986076355}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7795000076293945},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.7027999758720398},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6158999800682068},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5885999798774719},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5095000267028809},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5002999901771545},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4528000056743622},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45019999146461487},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.430400013923645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4277999997138977},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.382099986076355},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.3686000108718872},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3612000048160553},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.36059999465942383},{"id":"https://openalex.org/C153914771","wikidata":"https://www.wikidata.org/wiki/Q5227343","display_name":"Data reduction","level":2,"score":0.33309999108314514},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32409998774528503},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31779998540878296},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.31690001487731934},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30379998683929443},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2854999899864197},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.28540000319480896},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.2833999991416931},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.2727000117301941},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.26429998874664307}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-020-00736-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-020-00736-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00736-0.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:31150","is_oa":true,"landing_page_url":"http://dro.dur.ac.uk/31150/","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":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Algorithmica, 2020, Vol.82(12), pp.3521-3565 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:arXiv.org:1609.08879","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1609.08879","pdf_url":"https://arxiv.org/pdf/1609.08879","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"pmh:oai:durham-repository.worktribe.com:1299117","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1299117","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"}],"best_oa_location":{"id":"doi:10.1007/s00453-020-00736-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-020-00736-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00736-0.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"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/G8904030062","display_name":null,"funder_award_id":"NI 369/16","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"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/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2596114558.pdf","grobid_xml":"https://content.openalex.org/works/W2596114558.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1555816812","https://openalex.org/W1579049696","https://openalex.org/W1592014028","https://openalex.org/W1857705078","https://openalex.org/W1983248819","https://openalex.org/W2003813631","https://openalex.org/W2028503265","https://openalex.org/W2047281923","https://openalex.org/W2065410741","https://openalex.org/W2068928748","https://openalex.org/W2081880478","https://openalex.org/W2083116175","https://openalex.org/W2091299439","https://openalex.org/W2106579389","https://openalex.org/W2108763491","https://openalex.org/W2130673833","https://openalex.org/W2157529519","https://openalex.org/W2617953066","https://openalex.org/W2964074136","https://openalex.org/W4230551286","https://openalex.org/W4253175698"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Finding":[1],"maximum-cardinality":[2],"matchings":[3],"in":[4,29,115],"undirected":[5],"graphs":[6,89],"is":[7,24,51],"arguably":[8],"one":[9],"of":[10,102],"the":[11,69],"most":[12],"central":[13],"graph":[14],"primitives.":[15],"For":[16],"m":[17],"-edge":[18],"and":[19,83,90],"n":[20],"-vertex":[21],"graphs,":[22],"it":[23],"well-known":[25],"to":[26],"be":[27],"solvable":[28],"$$O(m\\sqrt{n})$$":[30],"<mml:math":[31],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[32],"<mml:mrow>":[33],"<mml:mi>O</mml:mi>":[34],"<mml:mo>(</mml:mo>":[35],"<mml:mi>m</mml:mi>":[36],"<mml:msqrt>":[37],"<mml:mi>n</mml:mi>":[38],"</mml:msqrt>":[39],"<mml:mo>)</mml:mo>":[40],"</mml:mrow>":[41],"</mml:math>":[42],"time;":[43],"however,":[44],"for":[45,87,91],"several":[46],"applications":[47],"this":[48],"running":[49],"time":[50],"still":[52],"too":[53],"slow.":[54],"We":[55,79],"investigate":[56],"how":[57],"linear-time":[58,76],"(and":[59],"almost":[60],"linear-time)":[61],"data":[62,95],"reduction":[63,96],"(used":[64],"as":[65],"preprocessing)":[66,103],"can":[67],"alleviate":[68],"situation.":[70],"More":[71],"specifically,":[72],"we":[73],"focus":[74],"on":[75],"kernelization":[77],".":[78],"start":[80],"a":[81],"deeper":[82],"systematic":[84],"study":[85],"both":[86],"general":[88],"bipartite":[92],"graphs.":[93],"Our":[94],"algorithms":[97],"easily":[98],"comply":[99],"(in":[100],"form":[101],"with":[104],"every":[105],"solution":[106],"strategy":[107],"(exact,":[108],"approximate,":[109],"heuristic),":[110],"thus":[111],"making":[112],"them":[113],"attractive":[114],"various":[116],"settings.":[117]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2017-03-23T00:00:00"}