Feedback Vertex Set in Mixed Graphs
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 2O(k)k! O(n4). This is the first fixed parameter tractable algorithm for FVS that applies to both directed and undirected graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.