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
机构
来源
基金
美国国家科学基金会;
关键词
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 条
  • [1] Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
    Chitnis, Rajesh
    Cygan, Marek
    Hajiaghayi, Mohammataghi
    Marx, Daniel
    ACM TRANSACTIONS ON ALGORITHMS, 2015, 11 (04)
  • [2] Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
    Chitnis, Rajesh
    Cygan, Marek
    Hajiaghayi, Mohammadtaghi
    Marx, Daniel
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012 PT I, 2012, 7391 : 230 - 241
  • [3] Subset Feedback Vertex Set Is Fixed-Parameter Tractable
    Cygan, Marek
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Wojtaszczyk, Jakub Onufry
    AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT I, 2011, 6755 : 449 - 461
  • [4] SUBSET FEEDBACK VERTEX SET IS FIXED-PARAMETER TRACTABLE
    Cygan, Marek
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Wojtaszczyk, Jakub Onufry
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (01) : 290 - 309
  • [5] A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem
    Chen, Jianer
    Liu, Yang
    Lu, Songjian
    O'Sullivan, Barry
    Razgon, Igor
    JOURNAL OF THE ACM, 2008, 55 (05)
  • [6] A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem
    Chen, Jianer
    Liu, Yang
    Lu, Songjian
    O'Sullivan, Barry
    Razgon, Igor
    STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 177 - 186
  • [7] Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments
    Hsiao, Sheng-Ying
    ALGORITHMS AND COMPUTATION, 2011, 7074 : 344 - 353
  • [8] The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable
    Cygan, Marek
    Marx, Daniel
    Pilipczuk, Marcin
    Pilipczuk, Michal
    2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 197 - 206
  • [9] Faster fixed parameter tractable algorithms for undirected feedback vertex set
    Raman, V
    Saurabh, S
    Subramanian, CR
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 241 - 248
  • [10] Fixed-parameter tractability for subset feedback set problems with parity constraints
    Kakimura, Naonori
    Kawarabayashi, Ken-ichi
    THEORETICAL COMPUTER SCIENCE, 2015, 576 : 61 - 76