{"id":"https://openalex.org/W2769128044","doi":"https://doi.org/10.1007/s00453-021-00904-w","title":"Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs","display_name":"Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs","publication_year":2022,"publication_date":"2022-01-06","ids":{"openalex":"https://openalex.org/W2769128044","doi":"https://doi.org/10.1007/s00453-021-00904-w","mag":"2769128044"},"language":"lv","primary_location":{"id":"doi:10.1007/s00453-021-00904-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-021-00904-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-021-00904-w.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","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-021-00904-w.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079179062","display_name":"Boris Klemz","orcid":"https://orcid.org/0000-0002-4532-3765"},"institutions":[{"id":"https://openalex.org/I25974101","display_name":"University of W\u00fcrzburg","ror":"https://ror.org/00fbnyb24","country_code":"DE","type":"education","lineage":["https://openalex.org/I25974101"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Boris Klemz","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t W\u00fcrzburg, Am Hubland, 97074, W\u00fcrzburg, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t W\u00fcrzburg, Am Hubland, 97074, W\u00fcrzburg, Germany","institution_ids":["https://openalex.org/I25974101"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083387191","display_name":"G\u00fcnter Rote","orcid":"https://orcid.org/0000-0002-0351-5945"},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"G\u00fcnter Rote","raw_affiliation_strings":["Institut f\u00fcr Informatik, Freie Universit\u00e4t Berlin, Takustr. 9, 14195, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Freie Universit\u00e4t Berlin, Takustr. 9, 14195, Berlin, Germany","institution_ids":["https://openalex.org/I75951250"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079179062"],"corresponding_institution_ids":["https://openalex.org/I25974101"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.3524,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.81995979,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"84","issue":"4","first_page":"1064","last_page":"1080"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9983000159263611,"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/bipartite-graph","display_name":"Bipartite graph","score":0.9010835289955139},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8551519513130188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7122699022293091},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.570389986038208},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5553323030471802},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5293579697608948},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.47018375992774963},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.46179720759391785},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4549309015274048},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.44598710536956787},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4454169273376465},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4307863712310791},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.41655951738357544},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4126681685447693},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37991902232170105},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32411089539527893},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2754269242286682},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23588189482688904},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11980593204498291},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.09932112693786621}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9010835289955139},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8551519513130188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7122699022293091},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.570389986038208},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5553323030471802},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5293579697608948},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.47018375992774963},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.46179720759391785},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4549309015274048},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.44598710536956787},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4454169273376465},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4307863712310791},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.41655951738357544},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4126681685447693},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37991902232170105},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32411089539527893},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2754269242286682},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23588189482688904},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11980593204498291},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.09932112693786621},{"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":5,"locations":[{"id":"doi:10.1007/s00453-021-00904-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-021-00904-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-021-00904-w.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:arXiv.org:1711.04496","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.04496","pdf_url":"https://arxiv.org/pdf/1711.04496","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:opus.bibliothek.uni-wuerzburg.de:26787","is_oa":true,"landing_page_url":"https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/26787","pdf_url":null,"source":{"id":"https://openalex.org/S4306401635","display_name":"Online Publication Service of W\u00fcrzburg University (W\u00fcrzburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I25974101","host_organization_name":"University of W\u00fcrzburg","host_organization_lineage":["https://openalex.org/I25974101"],"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":"","raw_type":"article"},{"id":"pmh:oai:refubium.fu-berlin.de:fub188/33847","is_oa":true,"landing_page_url":"https://refubium.fu-berlin.de/handle/fub188/33847","pdf_url":null,"source":{"id":"https://openalex.org/S4306402444","display_name":"Refubium (Universit\u00e4tsbibliothek der Freien Universit\u00e4t Berlin)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I75951250","host_organization_name":"Freie Universit\u00e4t Berlin","host_organization_lineage":["https://openalex.org/I75951250"],"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":"","raw_type":"doc-type:article"},{"id":"doi:10.17169/refubium-33566","is_oa":true,"landing_page_url":"https://doi.org/10.17169/refubium-33566","pdf_url":null,"source":{"id":"https://openalex.org/S7407052913","display_name":"Universit\u00e4tsbibliothek der FU Berlin Hochschulschriftenstelle u. Dokumentenserver","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1007/s00453-021-00904-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-021-00904-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-021-00904-w.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":[],"funders":[{"id":"https://openalex.org/F4320325356","display_name":"Julius-Maximilians-Universit\u00e4t W\u00fcrzburg","ror":"https://ror.org/00fbnyb24"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2769128044.pdf","grobid_xml":"https://content.openalex.org/works/W2769128044.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W21133947","https://openalex.org/W55887128","https://openalex.org/W639947448","https://openalex.org/W1974366154","https://openalex.org/W1974918981","https://openalex.org/W1977889556","https://openalex.org/W1999576733","https://openalex.org/W2007549941","https://openalex.org/W2015698277","https://openalex.org/W2020270928","https://openalex.org/W2024491681","https://openalex.org/W2026285219","https://openalex.org/W2031966632","https://openalex.org/W2032987509","https://openalex.org/W2036353623","https://openalex.org/W2043207029","https://openalex.org/W2043765170","https://openalex.org/W2058511514","https://openalex.org/W2068155033","https://openalex.org/W2068928748","https://openalex.org/W2101075550","https://openalex.org/W2132624129","https://openalex.org/W2583364872","https://openalex.org/W2913398500","https://openalex.org/W3037755027","https://openalex.org/W4210377846"],"related_works":["https://openalex.org/W1963831867","https://openalex.org/W2025716666","https://openalex.org/W4239226376","https://openalex.org/W2903563585","https://openalex.org/W3029871987","https://openalex.org/W2077261354","https://openalex.org/W2949886028","https://openalex.org/W4232683556","https://openalex.org/W2184969544","https://openalex.org/W1541277988"],"abstract_inverted_index":{"Abstract":[0],"A":[1,195],"bipartite":[2,88,124,183],"graph":[3,89,125],"$$G=(U,V,E)$$":[4],"<mml:math":[5,37,109,142,255,307],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[6,38,110,143,256,308],"<mml:mrow>":[7,39,111,144,257,309],"<mml:mi>G</mml:mi>":[8],"<mml:mo>=</mml:mo>":[9],"<mml:mo>(</mml:mo>":[10,113,259,311],"<mml:mi>U</mml:mi>":[11,42,147],"<mml:mo>,</mml:mo>":[12,14],"<mml:mi>V</mml:mi>":[13],"<mml:mi>E</mml:mi>":[15],"<mml:mo>)</mml:mo>":[16,117,263,316],"</mml:mrow>":[17,43,118,148,264,317],"</mml:math>":[18,44,119,149,265,318],"is":[19,64,198,246],"convex":[20,87,123,182],"if":[21],"the":[22,46,53,150,156,202,248,277,287,297],"vertices":[23,92],"in":[24,52,85,107,155,175,236,253,290,322],"V":[25,56,159],"can":[26,104,250],"be":[27,105,251],"linearly":[28],"ordered":[29],"such":[30,162],"that":[31,84,135,209,212],"for":[32,67,137,276,296],"each":[33,138],"vertex":[34,139],"$$u\\in":[35,140],"U$$":[36,141],"<mml:mi>u</mml:mi>":[40,145],"<mml:mo>\u2208</mml:mo>":[41,146],",":[45,166,208],"neighbors":[47],"of":[48,55,62,71,75,79,100,129,158,172,201,218,231,268,305],"u":[49],"are":[50,188],"consecutive":[51],"ordering":[54,157],".":[57,81,160,194],"An":[58,121],"induced":[59,98,170,186,216],"matching":[60,66,99,171],"H":[61,80],"G":[63],"a":[65,86,127,163,199,224,229,232,302],"which":[68],"no":[69,243],"edge":[70,203],"E":[72],"connects":[73],"endpoints":[74],"two":[76],"different":[77],"edges":[78],"We":[82],"show":[83],"with":[90],"n":[91,133,178,239],"and":[93,152,280,282,285],"m":[94],"weighted":[95,331],"edges,":[96],"an":[97,169],"maximum":[101,173],"total":[102],"weight":[103],"computed":[106,252],"$$O(n+m)$$":[108,254],"<mml:mi>O</mml:mi>":[112,258,310],"<mml:mi>n</mml:mi>":[114,260,313],"<mml:mo>+</mml:mo>":[115,261],"<mml:mi>m</mml:mi>":[116,262],"time.":[120,180,241,266],"unweighted":[122,298],"has":[126,333],"representation":[128,165,230,245],"size":[130],"O":[131,176,237],"(":[132,177,238],")":[134,179,240],"records":[136],"first":[151],"last":[153],"neighbor":[154],"Given":[161,223],"compact":[164,225,244],"we":[167,227],"compute":[168,228],"cardinality":[174],"In":[181],"graphs,":[184],"maximum-cardinality":[185],"matchings":[187,217],"dual":[189],"to":[190],"minimum":[191,233],"chain":[192,196,206,234],"covers":[193],"cover":[197,235,249],"covering":[200],"set":[204],"by":[205],"subgraphs":[207,211],"is,":[210],"do":[213],"not":[214,334],"contain":[215],"more":[219],"than":[220],"one":[221],"edge.":[222],"representation,":[226],"If":[242],"given,":[247],"All":[267],"our":[269],"algorithms":[270,295],"achieve":[271],"optimal":[272],"linear":[273],"running":[274,303],"time":[275,304],"respective":[278],"problem":[279,299],"model,":[281],"they":[283],"improve":[284],"generalize":[286],"previous":[288],"results":[289],"several":[291],"ways:":[292],"The":[293,330],"best":[294],"versions":[300],"had":[301],"$$O(n^2)$$":[306],"<mml:msup>":[312],"<mml:mn>2</mml:mn>":[314],"</mml:msup>":[315],"(Brandst\u00e4dt":[319],"et":[320],"al.":[321],"Theor.":[323],"Comput.":[324],"Sci.":[325],"381(1\u20133):260\u2013265,":[326],"2007.":[327],"10.1016/j.tcs.2007.04.006":[328],").":[329],"case":[332],"been":[335],"considered":[336],"before.":[337]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-24T08:02:53.985720","created_date":"2017-12-04T00:00:00"}