An approximation algorithm for the l-pseudoforest deletion problem
Theoretical Computer Science, pp. 446-454, 2020.
An l-pseudoforest is a graph each of whose connected components is at most l edges removal being a tree. The l-Pseudoforest Deletion problem is to delete a vertex set P of minimum weight from a given vertex-weighted graph G=(V,E) such that the remaining graph G[V∖P] is an l-pseudoforest. The Feedback Vertex Set problem is a special case o...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)