Feedback Vertex Set in Mixed Graphs
Data Structures and Algorithms
2015-03-17 v1
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 vertices contains a feedback vertex set (FVS) of size at most , in time . This is the first fixed parameter tractable algorithm for FVS that applies to both directed and undirected graphs.
Cite
@article{arxiv.1010.5974,
title = {Feedback Vertex Set in Mixed Graphs},
author = {Paul Bonsma and Daniel Lokshtanov},
journal= {arXiv preprint arXiv:1010.5974},
year = {2015}
}