Abstract
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 FPT search. Finally, we demonstrate that DFVS is not more helpful for deadlock recovery (with mutex locks) than simple cycle detection. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Fleischer, R., Wu, X., & Yuan, L. (2009). Experimental study of fpt algorithms for the directed feedback vertex set problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5757 LNCS, pp. 611–622). https://doi.org/10.1007/978-3-642-04128-0_55
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
