{"id":"https://openalex.org/W4406229239","doi":"https://doi.org/10.1002/jgt.23208","title":"The Complexity of Decomposing a Graph into a Matching and a Bounded Linear Forest","display_name":"The Complexity of Decomposing a Graph into a Matching and a Bounded Linear Forest","publication_year":2025,"publication_date":"2025-01-08","ids":{"openalex":"https://openalex.org/W4406229239","doi":"https://doi.org/10.1002/jgt.23208"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.23208","is_oa":true,"landing_page_url":"https://doi.org/10.1002/jgt.23208","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/jgt.23208","source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/jgt.23208","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039783864","display_name":"Agnijo Banerjee","orcid":null},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Agnijo Banerjee","raw_affiliation_strings":["Department of Pure Mathematics and Mathematical Statistics (DPMMS) University of Cambridge Cambridge UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Pure Mathematics and Mathematical Statistics (DPMMS) University of Cambridge Cambridge UK","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002802221","display_name":"Jo\u00e3o Pedro Marciano","orcid":"https://orcid.org/0009-0000-5539-9061"},"institutions":[{"id":"https://openalex.org/I141883831","display_name":"Instituto Nacional de Matem\u00e1tica Pura e Aplicada","ror":"https://ror.org/028caqe42","country_code":"BR","type":"facility","lineage":["https://openalex.org/I141883831","https://openalex.org/I4210151455"]},{"id":"https://openalex.org/I4210128604","display_name":"Instituto de Pesquisas Jardim Bot\u00e2nico do Rio de Janeiro","ror":"https://ror.org/033xtdz52","country_code":"BR","type":"archive","lineage":["https://openalex.org/I4210128604"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jo\u00e3o Pedro Marciano","raw_affiliation_strings":["Instituto Nacional de Matem\u00e1tica Pura e Aplicada (IMPA) Jardim Bot\u00e2nico Rio de Janeiro RJ Brazil"],"raw_orcid":"https://orcid.org/0009-0000-5539-9061","affiliations":[{"raw_affiliation_string":"Instituto Nacional de Matem\u00e1tica Pura e Aplicada (IMPA) Jardim Bot\u00e2nico Rio de Janeiro RJ Brazil","institution_ids":["https://openalex.org/I141883831","https://openalex.org/I4210128604"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033968775","display_name":"Adva Mond","orcid":"https://orcid.org/0000-0002-4805-7503"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Adva Mond","raw_affiliation_strings":["Department of Pure Mathematics and Mathematical Statistics (DPMMS) University of Cambridge Cambridge UK"],"raw_orcid":"https://orcid.org/0000-0002-4805-7503","affiliations":[{"raw_affiliation_string":"Department of Pure Mathematics and Mathematical Statistics (DPMMS) University of Cambridge Cambridge UK","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060158950","display_name":"Jan Petr","orcid":"https://orcid.org/0000-0003-3730-8263"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jan Petr","raw_affiliation_strings":["Department of Pure Mathematics and Mathematical Statistics (DPMMS) University of Cambridge Cambridge UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Pure Mathematics and Mathematical Statistics (DPMMS) University of Cambridge Cambridge UK","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023726998","display_name":"Julien Portier","orcid":"https://orcid.org/0000-0002-9847-0603"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Julien Portier","raw_affiliation_strings":["Department of Pure Mathematics and Mathematical Statistics (DPMMS) University of Cambridge Cambridge UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Pure Mathematics and Mathematical Statistics (DPMMS) University of Cambridge Cambridge UK","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5033968775"],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00902486,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"109","issue":"1","first_page":"76","last_page":"87"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T10142","display_name":"Formal Methods in Verification","score":0.9793000221252441,"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/mathematics","display_name":"Mathematics","score":0.8055295944213867},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.8038154244422913},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7627979516983032},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6319674253463745},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5914241671562195},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5539987683296204},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49014171957969666}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8055295944213867},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8038154244422913},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7627979516983032},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6319674253463745},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5914241671562195},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5539987683296204},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49014171957969666},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.23208","is_oa":true,"landing_page_url":"https://doi.org/10.1002/jgt.23208","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/jgt.23208","source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1002/jgt.23208","is_oa":true,"landing_page_url":"https://doi.org/10.1002/jgt.23208","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/jgt.23208","source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.46000000834465027}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320273","display_name":"University of Cambridge","ror":"https://ror.org/013meh722"},{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320321848","display_name":"Cambridge Trust","ror":"https://ror.org/05sprqy15"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320334670","display_name":"Trinity College, University of Cambridge","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4406229239.pdf","grobid_xml":"https://content.openalex.org/works/W4406229239.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1843974934","https://openalex.org/W1980484894","https://openalex.org/W1992605889","https://openalex.org/W2002540991","https://openalex.org/W2010042187","https://openalex.org/W2023683195","https://openalex.org/W2039274034","https://openalex.org/W2041884875","https://openalex.org/W2054076729","https://openalex.org/W2077574397","https://openalex.org/W2082674350","https://openalex.org/W2090014838","https://openalex.org/W2107587532","https://openalex.org/W2152986618","https://openalex.org/W2161215678","https://openalex.org/W2317309498","https://openalex.org/W2731891712","https://openalex.org/W3046360066","https://openalex.org/W3196221581","https://openalex.org/W3201899363","https://openalex.org/W4240416043","https://openalex.org/W4256646394","https://openalex.org/W4307079406","https://openalex.org/W4379650722","https://openalex.org/W4380629273","https://openalex.org/W4392934885"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W1992739770","https://openalex.org/W4386900933","https://openalex.org/W4229058035","https://openalex.org/W3125672081","https://openalex.org/W1519201794","https://openalex.org/W2767824041","https://openalex.org/W1629505938"],"abstract_inverted_index":{"ABSTRACT":[0],"Deciding":[1],"whether":[2,72],"a":[3,9,12,73,79,82],"graph":[4,74],"can":[5,75],"be":[6,25,76],"edge\u2010decomposed":[7,77],"into":[8,78],"matching":[10,80],"and":[11,22,33,81,98],"\u2010bounded":[13,83],"linear":[14],"forest":[15,85],"was":[16],"recently":[17],"shown":[18],"by":[19,51,95],"Campbell,":[20,96],"H\u00f6rsch,":[21,97],"Moore":[23,99],"to":[24],"nonedeterministic":[26],"Polynomial":[27],"time":[28,37],"(NP)\u2010complete":[29],"for":[30,38,58,89],"every":[31,59],",":[32,91],"solvable":[34,88],"in":[35],"polynomial":[36],".":[39,60],"In":[40,61],"the":[41,62,66,101],"first":[42],"part":[43,64],"of":[44,65],"this":[45,49,54],"paper,":[46,67],"we":[47,68],"close":[48],"gap":[50],"showing":[52],"that":[53,70],"problem":[55],"is":[56,86],"NP\u2010complete":[57],"second":[63],"show":[69],"deciding":[71],"star":[84],"polynomially":[87],"any":[90],"answering":[92],"another":[93],"question":[94],"from":[100],"same":[102],"paper.":[103]},"counts_by_year":[],"updated_date":"2026-03-09T07:00:12.390032","created_date":"2025-10-10T00:00:00"}