Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable

被引：0
|
作者：
A,V. Williams Building, Department of Computer Science, University of Maryland, College Park [1 ]
MD
20742, United States
不详 [2 ]
02-097, Poland
不详 [3 ]
H-1111, Hungary
机构：
来源：
ACM Trans. Algorithms | / 4卷
基金：
美国国家科学基金会;
关键词：
Engineering Village;
D O I：
a28
中图分类号：
学科分类号：
摘要：
Feedback vertex set - Fixed-parameter algorithms - Fixed-parameter tractability - Parameter dependence - Random sampling - Theory - Time algorithms - Undirected graph
引用
收藏
相关论文
共 50 条
  • [41] Almost 2-SAT is fixed-parameter tractable
    Razgon, Igor
    O'Sullivan, Barry
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2009, 75 (08) : 435 - 450
  • [42] Learning Deep ReLU Networks Is Fixed-Parameter Tractable
    Chen, Sitan
    Klivans, Adam R.
    Meka, Raghu
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 696 - 707
  • [43] Fixed-parameter tractable algorithms for Tracking Shortest Paths
    Banik, Aritra
    Choudhary, Pratibha
    Raman, Venkatesh
    Saurabh, Saket
    THEORETICAL COMPUTER SCIENCE, 2020, 846 : 1 - 13
  • [44] Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable
    Bandyapadhyay, Sayan
    Lochet, William
    Lokshtanov, Daniel
    Saurabh, Saket
    Xue, Jie
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 699 - 711
  • [45] Towards fixed-parameter tractable algorithms for abstract argumentation
    Dvorak, Wolfgang
    Pichler, Reinhard
    Woltran, Stefan
    ARTIFICIAL INTELLIGENCE, 2012, 186 : 1 - 37
  • [46] Fixed-parameter tractable algorithms for testing upward planarity
    Healy, P
    Lynch, K
    SOFSEM 2005:THEORY AND PRACTICE OF COMPUTER SCIENCE, 2005, 3381 : 199 - 208
  • [47] Fixed-Parameter Tractable Distances to Sparse Graph Classes
    Bulian, Jannis
    Dawar, Anuj
    ALGORITHMICA, 2017, 79 (01) : 139 - 158
  • [48] Fixed-Parameter Tractable Optimization Under DNNF Constraints
    Koriche, Frederic
    Le Berre, Daniel
    Lonca, Emmanuel
    Marquis, Pierre
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 1194 - 1202
  • [49] Fixed-Parameter Tractable Distances to Sparse Graph Classes
    Jannis Bulian
    Anuj Dawar
    Algorithmica, 2017, 79 : 139 - 158
  • [50] Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable
    Ramanujan, M. S.
    Szeider, Stefan
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 3929 - 3935
12345