2000 character limit reached
Feedback Vertex Set in Mixed Graphs
Published 28 Oct 2010 in cs.DS | (1010.5974v1)
Abstract: A mixed graph is a graph with both directed and undirected edges. We present an algorithm for deciding whether a given mixed graph on $n$ vertices contains a feedback vertex set (FVS) of size at most $k$, in time $2{O(k)}k! O(n4)$. This is the first fixed parameter tractable algorithm for FVS that applies to both directed and undirected graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
