Introduction to algorithms
On the feedback vertex set problem in permutation graphs
Information Processing Letters
A linear-time algorithm for the weighted feedback vertex problem on interval graphs
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Hi-index | 0.89 |
Given an undirected and vertex weighted graph G, the Weighted Feedback Vertex Problem (WFVP) consists in finding a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex in F. The WFVP on general graphs is known to be NP-hard. In this paper we introduce a new class of graphs, namely the diamond graphs, and give a linear time algorithm to solve WFVP on it.