{"id":"https://openalex.org/W4405592103","doi":"https://doi.org/10.1051/ita/2024015","title":"Enumerating Minimum Feedback Vertex Sets in directed graphs with union-cat trees","display_name":"Enumerating Minimum Feedback Vertex Sets in directed graphs with union-cat trees","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4405592103","doi":"https://doi.org/10.1051/ita/2024015"},"language":"en","primary_location":{"id":"doi:10.1051/ita/2024015","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ita/2024015","pdf_url":"https://www.rairo-ita.org/articles/ita/pdf/2024/01/ita220056.pdf","source":{"id":"https://openalex.org/S4220651353","display_name":"RAIRO. Theoretical informatics and applications","issn_l":"2804-7346","issn":["2804-7346"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.rairo-ita.org/articles/ita/pdf/2024/01/ita220056.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017702462","display_name":"Moussa Abdenbi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Moussa Abdenbi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113854773","display_name":"Alexandre Blondin Mass\u00e9","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexandre Blondin Mass\u00e9","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111787169","display_name":"A Goupil","orcid":"https://orcid.org/0009-0006-0180-3624"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alain Goupil","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087411076","display_name":"M\u00e9lodie Lapointe","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M\u00e9lodie Lapointe","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5115549799","display_name":"Martin Lavoie","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin Lavoie","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5017702462"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28467734,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"58","issue":null,"first_page":"18","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9988999962806702,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9984999895095825,"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/T10142","display_name":"Formal Methods in Verification","score":0.9968000054359436,"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/vertex","display_name":"Vertex (graph theory)","score":0.6852490901947021},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6024110913276672},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.6015624403953552},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5020918846130371},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39264723658561707},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36636435985565186},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.343833863735199}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6852490901947021},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6024110913276672},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.6015624403953552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5020918846130371},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39264723658561707},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36636435985565186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.343833863735199}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1051/ita/2024015","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ita/2024015","pdf_url":"https://www.rairo-ita.org/articles/ita/pdf/2024/01/ita220056.pdf","source":{"id":"https://openalex.org/S4220651353","display_name":"RAIRO. Theoretical informatics and applications","issn_l":"2804-7346","issn":["2804-7346"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1051/ita/2024015","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ita/2024015","pdf_url":"https://www.rairo-ita.org/articles/ita/pdf/2024/01/ita220056.pdf","source":{"id":"https://openalex.org/S4220651353","display_name":"RAIRO. Theoretical informatics and applications","issn_l":"2804-7346","issn":["2804-7346"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4405592103.pdf"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1482680420","https://openalex.org/W1506768432","https://openalex.org/W1519004817","https://openalex.org/W1524788828","https://openalex.org/W1585836462","https://openalex.org/W1766547439","https://openalex.org/W1975335740","https://openalex.org/W1984425270","https://openalex.org/W2004809831","https://openalex.org/W2011576340","https://openalex.org/W2025641101","https://openalex.org/W2037651963","https://openalex.org/W2047470084","https://openalex.org/W2047766986","https://openalex.org/W2074524916","https://openalex.org/W2080267935","https://openalex.org/W2081880478","https://openalex.org/W2089749235","https://openalex.org/W2106669085","https://openalex.org/W2107019937","https://openalex.org/W2108161550","https://openalex.org/W2121557786","https://openalex.org/W2155010807","https://openalex.org/W2401610261","https://openalex.org/W4235505822","https://openalex.org/W4315784876"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W3111310291","https://openalex.org/W2951429970","https://openalex.org/W2145212918","https://openalex.org/W2536906705","https://openalex.org/W4387914616","https://openalex.org/W2351427475","https://openalex.org/W2004969038","https://openalex.org/W2077115523","https://openalex.org/W2100121598"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,27,75,102,105,109,125,128],"finding":[3],"a":[4,11,72,88,99,103,110],"minimum":[5],"feedback":[6],"vertex":[7],"set":[8,124],"(MFVS)":[9],"in":[10,31,52,96],"directed":[12,130],"graph":[13,64],"has":[14],"been":[15,48],"known":[16],"to":[17,38,121],"be":[18],"NP-hard":[19],"for":[20,71],"around":[21],"40":[22],"years:":[23],"It":[24],"is":[25,69],"one":[26],"the":[28,40,123],"problems":[29],"listed":[30],"Karp\u2019s":[32],"famous":[33],"1972":[34],"paper.":[35],"Several":[36],"strategies":[37],"solve":[39],"MFVS":[41],"problem,":[42],"both":[43],"exact":[44,59],"and":[45,55,118],"approximate,":[46],"have":[47],"proposed.":[49],"In":[50],"particular,":[51],"2000,":[53],"Lin":[54,117],"Jou":[56],"presented":[57],"an":[58],"algorithm":[60,120],"based":[61],"on":[62],"eight":[63],"contraction":[65],"operators":[66],"whose":[67],"complexity":[68],"polynomial":[70],"particular":[73],"class":[74],"graphs":[76],"called":[77,91],"DOME-contractible":[78],"graphs.":[79],"This":[80],"paper":[81],"proposes":[82],"two":[83],"contributions.":[84],"First,":[85],"we":[86,115],"introduce":[87],"data":[89],"structure":[90],"union-cat":[92],"tree":[93],"that":[94],"provides,":[95],"some":[97],"cases,":[98],"compact":[100],"representation":[101],"family":[104],"constant":[106],"size":[107],"subsets":[108],"given":[111],"finite":[112],"set.":[113],"Secondly,":[114],"extend":[116],"Jou\u2019s":[119],"compute":[122],"all":[126],"MFVSs":[127],"any":[129],"graph.":[131]},"counts_by_year":[],"updated_date":"2025-12-27T23:08:20.325037","created_date":"2025-10-10T00:00:00"}