An FPT algorithm for edge subset feedback edge set

Authors:
Mingyu Xiao;Hiroshi Nagamochi
Affiliations:
School of Computer Science and Engineering, University of Electronic Science and Technology of China, China;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan
Venue:
Information Processing Letters
Year:
2012

Citing 5
Cited 0

An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem

SIAM Journal on Computing
A fixed-parameter algorithm for the directed feedback vertex set problem

Journal of the ACM (JACM)
Improved algorithms for feedback vertex set problems

Journal of Computer and System Sciences
Simple and Improved Parameterized Algorithms for Multiterminal Cuts

Theory of Computing Systems - Special Issue: Symposium on Computer Science; Guest Editors: Sergei Artemov, Volker Diekert and Alexander Razborov
Subset feedback vertex set is fixed-parameter tractable

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I

Quantified Score

Hi-index	0.89

Visualization

Abstract

Given a graph G=(V,E) with a subset S@?E of edges, the edge subset feedback edge set problem is to find a smallest set F of edges such that in G^'=(V,E-F) no cycle contains an edge in S. We also define a restricted version of this problem, in which no edge in S is allowed to be selected into F to form a solution. In this paper, we give a linear-time algorithm for the edge subset feedback edge set problem, and show that the restricted version is NP-hard for fixed |S|=2 and fixed-parameter tractable with parameter being k=|F|.