Carrabs, Francesco, Cerulli, Raffaele, Gentili, Monica and Parlato, Gennaro
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds.
Inf. Process. Lett., 94, (1), .
Given an undirected and vertex weighted graph G, the Weighted Feedback Vertex Problem (WFVP) consists in finding a subset Fsubset of or equal toV 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.
Actions (login required)