{"id":"https://openalex.org/W4212964627","doi":"https://doi.org/10.1145/3504027","title":"Detecting Feedback Vertex Sets of Size <i>k</i> in <i>O</i> <sup>\u22c6</sup> (2.7 <i>k</i> ) Time","display_name":"Detecting Feedback Vertex Sets of Size <i>k</i> in <i>O</i> <sup>\u22c6</sup> (2.7 <i>k</i> ) Time","publication_year":2022,"publication_date":"2022-02-14","ids":{"openalex":"https://openalex.org/W4212964627","doi":"https://doi.org/10.1145/3504027"},"language":"en","primary_location":{"id":"doi:10.1145/3504027","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3504027","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3504027","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3504027","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100762970","display_name":"Jason Li","orcid":"https://orcid.org/0000-0002-1150-3549"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jason Li","raw_affiliation_strings":["Carnegie Mellon University, Pittsburg, Kansas"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburg, Kansas","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Utrecht University, Utrecht, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-1848-0076","affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8621,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.74823539,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"18","issue":"4","first_page":"1","last_page":"26"},"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.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/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/feedback-vertex-set","display_name":"Feedback vertex set","score":0.6708864569664001},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.658453106880188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.649789571762085},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5729801654815674},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.531703531742096},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4950096011161804},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4676584303379059},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4571947157382965},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45289814472198486},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33035537600517273}],"concepts":[{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.6708864569664001},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.658453106880188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.649789571762085},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5729801654815674},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.531703531742096},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4950096011161804},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4676584303379059},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4571947157382965},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45289814472198486},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33035537600517273},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3504027","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3504027","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3504027","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3504027","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3504027","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3504027","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4212964627.pdf","grobid_xml":"https://content.openalex.org/works/W4212964627.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1517074594","https://openalex.org/W1532197868","https://openalex.org/W1971393213","https://openalex.org/W1979312598","https://openalex.org/W2038173927","https://openalex.org/W2047766986","https://openalex.org/W2051856222","https://openalex.org/W2059273723","https://openalex.org/W2059451253","https://openalex.org/W2081880478","https://openalex.org/W2084595628","https://openalex.org/W2091977535","https://openalex.org/W2120248756","https://openalex.org/W2125350407","https://openalex.org/W2146221397","https://openalex.org/W2151720296","https://openalex.org/W2157295389","https://openalex.org/W2191626561","https://openalex.org/W2401610261","https://openalex.org/W2404960361","https://openalex.org/W2514415970","https://openalex.org/W2568031003","https://openalex.org/W2580171847","https://openalex.org/W2592611715","https://openalex.org/W2592840164","https://openalex.org/W2610479830","https://openalex.org/W2914414140","https://openalex.org/W2963179814","https://openalex.org/W2963205614","https://openalex.org/W2963554461","https://openalex.org/W3101258912","https://openalex.org/W3102351898","https://openalex.org/W4231643960"],"related_works":["https://openalex.org/W2952206082","https://openalex.org/W2145212918","https://openalex.org/W2892180138","https://openalex.org/W2951429970","https://openalex.org/W43934320","https://openalex.org/W2396010974","https://openalex.org/W1650804192","https://openalex.org/W2536906705","https://openalex.org/W4286853492","https://openalex.org/W3199337566"],"abstract_inverted_index":{"In":[0,93,152],"the":[1,49,68,102,110,117,157,218,231],"Feedback":[2,43],"Vertex":[3,44],"Set":[4,45],"(FVS)":[5],"problem,":[6],"one":[7,20,47,219],"is":[8,46],"given":[9,184],"an":[10,15,59],"undirected":[11],"graph":[12],"G":[13,37],"and":[14,19,87,159],"integer":[16],"k":[17,30,143,165,191],",":[18,115],"needs":[21],"to":[22,130,228,230],"determine":[23],"whether":[24],"there":[25,95],"exists":[26],"a":[27,98,133,138,161,185,196,212],"set":[28,188],"of":[29,36,48,109,189,192,199],"vertices":[31],"that":[32],"intersects":[33],"all":[34,173],"cycles":[35],"(a":[38],"so-called":[39],"feedback":[40,186],"vertex":[41,187],"set).":[42],"most":[50],"central":[51],"problems":[52],"in":[53,67,106,124,135,206],"parameterized":[54],"complexity:":[55],"It":[56],"served":[57],"as":[58,71],"excellent":[60],"testbed":[61],"for":[62,101],"many":[63],"important":[64],"algorithmic":[65],"techniques":[66,175],"field":[69],"such":[70],"Iterative":[72],"Compression":[73],"[Guo":[74],"et":[75,81,90,222],"al.":[76,82,91,223],"(JCSS\u201906)],":[77],"Randomized":[78],"Branching":[79],"[Becker":[80,221],"(J.":[83,224],"Artif.":[84,225],"Intell.":[85,226],"Res\u201900)]":[86,227],"Cut&amp;Count":[88,149],"[Cygan":[89],"(FOCS\u201911)].":[92],"particular,":[94],"has":[96],"been":[97],"long":[99],"race":[100,128],"smallest":[103],"dependence":[104],"f(k)":[105],"run":[107,241],"times":[108],"type":[111],"O":[112,118,140,162],"\u22c6":[113,119,141,163],"(f(k))":[114],"where":[116],"notation":[120],"omits":[121],"factors":[122],"polynomial":[123,207],"n":[125],".":[126],"This":[127],"seemed":[129],"have":[131],"reached":[132],"conclusion":[134],"2011,":[136],"when":[137],"randomized":[139,168,213],"(3":[142],")":[144,166],"time":[145,167,242],"algorithm":[146,171],"based":[147],"on":[148],"was":[150],"introduced.":[151],"this":[153],"work,":[154],"we":[155,181,210,238],"show":[156,182],"contrary":[158],"give":[160,211],"(2.7":[164],"algorithm.":[169],"Our":[170],"combines":[172],"mentioned":[174],"with":[176],"substantial":[177],"new":[178],"ideas:":[179],"First,":[180],"that,":[183],"size":[190],"bounded":[193,233],"average":[194,234],"degree,":[195],"tree":[197],"decomposition":[198],"width":[200],"(1-\u03a9":[201],"(1))k":[202],"can":[203],"be":[204],"found":[205],"time.":[208],"Second,":[209],"branching":[214],"strategy":[215],"inspired":[216],"by":[217,244],"from":[220],"reduce":[229],"aforementioned":[232],"degree":[235],"setting.":[236],"Third,":[237],"obtain":[239],"significant":[240],"improvements":[243],"employing":[245],"fast":[246],"matrix":[247],"multiplication.":[248]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}