42 search results - page 3 / 9 » Feedback Vertex Set on Graphs of Low Cliquewidth |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
IEICET
2006
13 years 7 months ago
2006
WADS
2005
Springer
14 years 25 days ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
ISAAC
2005
Springer
14 years 26 days ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...