{"id":"https://openalex.org/W2999246665","doi":"https://doi.org/10.37236/7837","title":"An Edmonds-Gallai-Type Decomposition for the j-Restricted k-Matching Problem","display_name":"An Edmonds-Gallai-Type Decomposition for the j-Restricted k-Matching Problem","publication_year":2020,"publication_date":"2020-01-10","ids":{"openalex":"https://openalex.org/W2999246665","doi":"https://doi.org/10.37236/7837","mag":"2999246665"},"language":"en","primary_location":{"id":"doi:10.37236/7837","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7837","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v27i1p15/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v27i1p15/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100382119","display_name":"Yanjun Li","orcid":"https://orcid.org/0000-0002-6277-4189"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yanjun Li","raw_affiliation_strings":["Krannert School of Management, Purdue University, West Lafayette, IN, USA"],"affiliations":[{"raw_affiliation_string":"Krannert School of Management, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109584874","display_name":"J\u00e1cint Szab\u00f3","orcid":null},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"J\u00e1cint Szab\u00f3","raw_affiliation_strings":["Google Switzerland, Brandschenkestrasse 110, CH-8802 Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Google Switzerland, Brandschenkestrasse 110, CH-8802 Zurich, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100382119"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03245659,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9721999764442444,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9721999764442444,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9539999961853027,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9524999856948853,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8713350296020508},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8539763689041138},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6735169887542725},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.635513424873352},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6297183036804199},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5515581369400024},{"id":"https://openalex.org/keywords/decomposition-theorem","display_name":"Decomposition theorem","score":0.5507777333259583},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5002496242523193},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4697468876838684},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.46803855895996094},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4542522728443146}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8713350296020508},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8539763689041138},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6735169887542725},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.635513424873352},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6297183036804199},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5515581369400024},{"id":"https://openalex.org/C2779182943","wikidata":"https://www.wikidata.org/wiki/Q25345219","display_name":"Decomposition theorem","level":2,"score":0.5507777333259583},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5002496242523193},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4697468876838684},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46803855895996094},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4542522728443146},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/7837","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7837","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v27i1p15/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/7837","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7837","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v27i1p15/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2999246665.pdf","grobid_xml":"https://content.openalex.org/works/W2999246665.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1963596676","https://openalex.org/W1996482242","https://openalex.org/W2033637560","https://openalex.org/W2037953913","https://openalex.org/W2038558760","https://openalex.org/W2053711501","https://openalex.org/W2067665587","https://openalex.org/W2086077818","https://openalex.org/W2092664455","https://openalex.org/W3000432478","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W1972035260","https://openalex.org/W2052299349","https://openalex.org/W2380059383","https://openalex.org/W2063679720","https://openalex.org/W1901944325","https://openalex.org/W2794488505","https://openalex.org/W4301594054","https://openalex.org/W4297728441","https://openalex.org/W4243997912","https://openalex.org/W2999246665"],"abstract_inverted_index":{"Given":[0],"a":[1,6,10,14,19,48,52],"non-negative":[2,35],"integer":[3,8],"$j$":[4],"and":[5,51,61,73,110,112],"positive":[7],"$k$,":[9],"$j$-restricted":[11,38,90],"$k$-matching":[12,39,91],"in":[13],"simple":[15],"undirected":[16],"graph":[17],"is":[18],"$k$-matching,":[20],"so":[21],"that":[22],"each":[23],"of":[24,66,121],"its":[25],"connected":[26],"components":[27],"has":[28],"at":[29],"least":[30],"$j+1$":[31],"edges.":[32],"The":[33],"maximum":[34],"node":[36,71],"weighted":[37],"problem":[40,68,92],"was":[41],"recently":[42],"studied":[43],"by":[44,107],"Li":[45],"who":[46],"gave":[47],"polynomial-time":[49],"algorithm":[50],"min-max":[53,119],"theorem":[54,87,120],"for":[55,88,103],"$0":[56,94],"\\leqslant":[57,75,77,95],"j":[58,96],"<":[59,97],"k$,":[60,98],"also":[62],"proved":[63],"the":[64,67,89,100,118],"NP-hardness":[65],"with":[69,93],"unit":[70],"weights":[72],"$2":[74],"k":[76],"j$.":[78],"In":[79],"this":[80],"paper":[81],"we":[82],"derive":[83],"an":[84,114],"Edmonds\u2013Gallai-type":[85],"decomposition":[86,102],"using":[99],"analogous":[101],"$k$-piece":[104],"packings":[105],"given":[106],"Janata,":[108],"Loebl":[109],"Szab\u00f3,":[111],"give":[113],"alternative":[115],"proof":[116],"to":[117],"Li.":[122]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}