A Note on Finding Dual Feedback Vertex Set
نویسنده
چکیده
For an edge-bicolored graph G where each edge is colored either red or blue, a vertex set S is a dual feedback vertex set if S hits all blue cycles and red cycles of G. In this paper, we show that a dual feedback vertex set of size at most k can be found in time O∗(ck1) and all minimal dual feedback vertex set of size at most k can be enumerated in time O(c +k 2 ) by compact representations for constants c1 and c2.
منابع مشابه
Parameterized algorithms for feedback set problems and their duals in tournaments
The parameterized feedback vertex (arc) set problem is to find whether there are k vertices (arcs) in a given graph whose removal makes the graph acyclic. The parameterized complexity of this problem in general directed graphs is a long standing open problem. We investigate the problems on tournaments, a well studied class of directed graphs. We consider both weighted and unweighted versions. W...
متن کاملPrimal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs
A b s t r a c t . Given a subset of cycles of a graph, we consider the problem of finding a minimum-weight set of vertices that meets all cycles in the subset. This problem generalizes a number of problems, including the minlmum-weight feedback vertex set problem in both directed and undirected graphs, the subset feedback vertex set problem, and the graph bipartization problem~ in which one mus...
متن کاملA note on the Roman domatic number of a digraph
Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling$fcolon V(D)to {0, 1, 2}$such that every vertex with label $0$ has an in-neighbor with label $2$. A set ${f_1,f_2,ldots,f_d}$ ofRoman dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vin V(D)$,is called a {em Roman dominating family} (of functions) on $D$....
متن کاملFinding a Minimum Feedback Vertex Set in time
We present an O(1.7548) algorithm finding a minimum feedback vertex set in a graph on n vertices.
متن کاملFinding a Minimum Feedback Vertex Set in Time O (1.7548n)
We present an O(1.7548) algorithm finding a minimum feedback vertex set in a graph on n vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1510.00773 شماره
صفحات -
تاریخ انتشار 2015