{"id":"https://openalex.org/W4384133395","doi":"https://doi.org/10.1007/s00453-023-01149-5","title":"Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage","display_name":"Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage","publication_year":2023,"publication_date":"2023-07-13","ids":{"openalex":"https://openalex.org/W4384133395","doi":"https://doi.org/10.1007/s00453-023-01149-5"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-023-01149-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-023-01149-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-023-01149-5.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":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-023-01149-5.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050290231","display_name":"Charis Papadopoulos","orcid":"https://orcid.org/0000-0001-5556-2981"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Charis Papadopoulos","raw_affiliation_strings":["Department of Mathematics, University of Ioannina, Ioannina, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Ioannina, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037272418","display_name":"Spyridon Tzimas","orcid":null},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Spyridon Tzimas","raw_affiliation_strings":["Department of Mathematics, University of Ioannina, Ioannina, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Ioannina, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050290231"],"corresponding_institution_ids":["https://openalex.org/I194019607"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.3932,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64194212,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"86","issue":"3","first_page":"874","last_page":"906"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9926999807357788,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9857000112533569,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.7993375062942505},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.6285369992256165},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6166684627532959},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6011900305747986},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5226942300796509},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4708276093006134},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42812132835388184},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4271073341369629},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42073673009872437},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39879095554351807},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3969942331314087},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.26059412956237793},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.11157789826393127},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06175106763839722}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7993375062942505},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.6285369992256165},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6166684627532959},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6011900305747986},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5226942300796509},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4708276093006134},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42812132835388184},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4271073341369629},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42073673009872437},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39879095554351807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3969942331314087},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.26059412956237793},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.11157789826393127},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06175106763839722}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-023-01149-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-023-01149-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-023-01149-5.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"}],"best_oa_location":{"id":"doi:10.1007/s00453-023-01149-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-023-01149-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-023-01149-5.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/G7045494254","display_name":null,"funder_award_id":"HFRI-FM17-431","funder_id":"https://openalex.org/F4320327859","funder_display_name":"Hellenic Foundation for Research and Innovation"}],"funders":[{"id":"https://openalex.org/F4320318628","display_name":"Hellenic Academic Libraries Link","ror":null},{"id":"https://openalex.org/F4320327859","display_name":"Hellenic Foundation for Research and Innovation","ror":null},{"id":"https://openalex.org/F4320331527","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4384133395.pdf"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W639947448","https://openalex.org/W1522469957","https://openalex.org/W1976489861","https://openalex.org/W1978452004","https://openalex.org/W1993412054","https://openalex.org/W1997576329","https://openalex.org/W2006147407","https://openalex.org/W2006278018","https://openalex.org/W2024491681","https://openalex.org/W2028363955","https://openalex.org/W2037968786","https://openalex.org/W2051627428","https://openalex.org/W2053536525","https://openalex.org/W2072585366","https://openalex.org/W2073279057","https://openalex.org/W2081091322","https://openalex.org/W2084983168","https://openalex.org/W2097374444","https://openalex.org/W2110960146","https://openalex.org/W2119014043","https://openalex.org/W2127689597","https://openalex.org/W2141925838","https://openalex.org/W2401610261","https://openalex.org/W2568407640","https://openalex.org/W2759740247","https://openalex.org/W2905121141","https://openalex.org/W2910798513","https://openalex.org/W2914414140","https://openalex.org/W2963232359","https://openalex.org/W2963520829","https://openalex.org/W2963832031","https://openalex.org/W2972576179","https://openalex.org/W2972989051","https://openalex.org/W2977258053","https://openalex.org/W3003449463","https://openalex.org/W3197901415","https://openalex.org/W4205776219","https://openalex.org/W4232896595"],"related_works":["https://openalex.org/W2006955534","https://openalex.org/W2075531723","https://openalex.org/W2945561475","https://openalex.org/W2153789027","https://openalex.org/W1987143101","https://openalex.org/W1994156213","https://openalex.org/W4285659194","https://openalex.org/W4389814085","https://openalex.org/W2251679127","https://openalex.org/W2272336114"],"abstract_inverted_index":{"Abstract":[0],"Chordal":[1],"graphs":[2,8,33,37,59,135,285,368,394,396,421],"are":[3],"characterized":[4],"as":[5,20,35,354],"the":[6,21,25,52,61,146,168,175,180,272,280,320,326,331,404,416],"intersection":[7],"of":[9,31,44,57,105,115,145,148,152,159,170,183,275,333,335,391,406,411],"subtrees":[10],"in":[11,28,54,163,185,196,338],"a":[12,16,45,69,86,102,113,142,160,186,209,339,351,378,388,408],"tree":[13,22,161,187,340],"and":[14,85,395,414],"such":[15,34],"representation":[17],"is":[18,60,119,271,297,315,347,401],"known":[19,120,282,418],"model.":[23,188,341],"Restricting":[24],"characterization":[26],"results":[27],"well-known":[29],"subclasses":[30,56,151],"chordal":[32,58,139,153,201,210,367],"interval":[36,126],"or":[38],"split":[39,134],"graphs.":[40,140],"A":[41],"typical":[42],"example":[43],"problem":[46],"that":[47,108,191,278,295,345,357],"does":[48],"not":[49],"behave":[50],"computationally":[51],"same":[53],"all":[55,110],"Subset":[62],"Feedback":[63],"Vertex":[64],"Set":[65],"(SFVS)":[66],"problem:":[67],"given":[68,208],"vertex-weighted":[70],"graph":[71,202,211,409],"$$G=(V,E)$$":[72],"<mml:math":[73,90,219,236,254,304],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[74,91,220,237,255,305],"<mml:mrow>":[75,92,240,258],"<mml:mi>G</mml:mi>":[76],"<mml:mo>=</mml:mo>":[77],"<mml:mo>(</mml:mo>":[78,242,260],"<mml:mi>V</mml:mi>":[79,95],"<mml:mo>,</mml:mo>":[80],"<mml:mi>E</mml:mi>":[81],"<mml:mo>)</mml:mo>":[82,244,265],"</mml:mrow>":[83,96,245,266],"</mml:math>":[84,97,222,247,268,307],"set":[87,104],"$$S\\subseteq":[88],"V$$":[89],"<mml:mi>S</mml:mi>":[93],"<mml:mo>\u2286</mml:mo>":[94],",":[98,177,223,248,269,323],"we":[99,155,173,224,343,355,376],"seek":[100],"for":[101,199,228,284,381,420],"vertex":[103,114,321,370],"minimum":[106,181,327],"weight":[107],"intersects":[109],"cycles":[111],"containing":[112],"S":[116],".":[117,308],"SFVS":[118,129,149,192,230,296,358,383],"to":[121,165,317,349],"be":[122,194],"polynomial-time":[123,379],"solvable":[124],"on":[125,133,138,150,212,330,362,384],"graphs,":[127,154,365,387],"whereas":[128],"remains":[130,359],"np":[131,360],"-complete":[132,361],"and,":[136],"consequently,":[137],"Towards":[141],"better":[143],"understanding":[144],"complexity":[147],"exploit":[156],"structural":[157],"properties":[158],"model":[162],"order":[164],"cope":[166],"with":[167,203,215,231,286,397,422],"hardness":[169],"SFVS.":[171],"Here":[172],"consider":[174,319],"leafage":[176,216,322,371],"which":[178,270,324,400],"measures":[179,325],"number":[182,332],"leaves":[184,334],"We":[189,289],"show":[190,344],"can":[193],"solved":[195],"polynomial":[197],"time":[198,233,274],"every":[200,336],"bounded":[204,287,423],"leafage.":[205],"In":[206],"particular,":[207],"n":[213],"vertices":[214],"$$\\ell":[217,302],"$$":[218,303],"<mml:mi>\u2113</mml:mi>":[221,243,262,306],"provide":[225,377],"an":[226,276],"algorithm":[227,283,380,419],"solving":[229,382],"running":[232,273],"$$n^{O(\\ell":[234,252],")}$$":[235],"<mml:msup>":[238,256,261],"<mml:mi>n</mml:mi>":[239,257],"<mml:mi>O</mml:mi>":[241,259],"</mml:msup>":[246,264,267],"thus":[249],"improving":[250],"upon":[251],"^2)}$$":[253],"<mml:mn>2</mml:mn>":[263],"approach":[277,405],"utilizes":[279],"previously":[281,417],"mim-width.":[288,424],"complement":[290],"our":[291,311],"result":[292],"by":[293,301],"showing":[294],"w":[298],"[1]-hard":[299],"parameterized":[300],"Pushing":[309],"further":[310],"positive":[312],"result,":[313,353],"it":[314,346],"natural":[316],"also":[318],"upper":[328],"bound":[329],"subtree":[337],"However,":[342],"unlikely":[348],"obtain":[350],"similar":[352],"prove":[356],"undirected":[363,392],"path":[364,386,393],"i.e.,":[366],"having":[369],"at":[372],"most":[373],"two.":[374],"Lastly,":[375],"rooted":[385],"proper":[389],"subclass":[390],"mim-width":[398,412],"one,":[399],"faster":[402],"than":[403],"constructing":[407],"decomposition":[410],"one":[413],"applying":[415]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}