Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem

被引：0
|
作者：
Fleischer, Rudolf [1 ]
Wu, Xi
Yuan, Liwei
机构：
[1] Fudan Univ, Shanghai 200433, Peoples R China
来源：
ALGORITHMS - ESA 2009, PROCEEDINGS | 2009年 / 5757卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We evaluate the performance of FPT algorithms for the directed feedback vertex set problem (DFVS). We propose several new data reduction rules for DFVS. which can significantly reduce the search space. We also propose various heuristics to accelerate the EPT search. Finally, we demonstrate that DFVS is not more helpful for deadlock recovery (with mutex locks) than simple cycle detection.
引用
收藏
页码：611 / +
页数：2
相关论文
共 50 条
  • [31] An O(2O(k)n3) FPT algorithm for the undirected Feedback Vertex Set problem
    Dehne, F
    Fellows, M
    Langston, MA
    Rosamond, F
    Stevens, K
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 859 - 869
  • [32] IDENTIFICATION OF A MINIMAL FEEDBACK VERTEX SET OF A DIRECTED GRAPH
    SMITH, GW
    WALFORD, RB
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1975, CA22 (01): : 9 - 15
  • [33] Towards a Polynomial Kernel for Directed Feedback Vertex Set
    Benjamin Bergougnoux
    Eduard Eiben
    Robert Ganian
    Sebastian Ordyniak
    M. S. Ramanujan
    Algorithmica, 2021, 83 : 1201 - 1221
  • [34] Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference
    Bar-Yehuda, R
    Geiger, D
    Naor, J
    Roth, RM
    SIAM JOURNAL ON COMPUTING, 1998, 27 (04) : 942 - 959
  • [35] ON THE FEEDBACK VERTEX SET PROBLEM IN PERMUTATION GRAPHS
    LIANG, YD
    INFORMATION PROCESSING LETTERS, 1994, 52 (03) : 123 - 129
  • [36] The Feedback Vertex Set Problem of Multiplex Networks
    Zhao, Dawei
    Xu, Lijuan
    Qin, Shao-Meng
    Liu, Guangqi
    Wang, Zhen
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2020, 67 (12) : 3492 - 3496
  • [37] On the feedback vertex set problem for a planar graph
    Praktische Mathematik, Chrstn.-Albrechts-Univ. zu Kiel, D-24098 Kiel, Germany
    Comput Vienna New York, 2 (129-155):
  • [38] On the feedback vertex set problem for a planar graph
    Hackbusch, W
    COMPUTING, 1997, 58 (02) : 129 - 155
  • [39] Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms
    Acharyya, Ankush
    Keikha, Vahideh
    Majumdar, Diptapriyo
    Pandit, Supantha
    THEORETICAL COMPUTER SCIENCE, 2024, 990
  • [40] Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms
    Acharyya, Ankush
    Keikha, Vahideh
    Majumdar, Diptapriyo
    Pandit, Supantha
    Theoretical Computer Science, 2024, 990
12345