A feedback vertex set is a subset of vertices whose deletion makes the remaining graph a forest. We show that the minimum FVS (MFVS) in star convex bipartite graphs is NP-hard to find, and give a tighter lower bound on the size of MFVS in sparse random graphs, to provide further evidence on the hardness of random CSPs. ? 2011 Springer-Verlag.EI
We study feedback vertex sets (FVS) in tournaments, which are orientations of complete graphs. As ou...
We consider the minimum feedback vertex set problem for some bipartite graphs and degree-constrained...
Let G be a directed graph. A vertex set F is called feedback vertex set (FVS) if its removal from G ...
A feedback vertex set in a graph is a subset of vertices, such that the complement of this subset in...
In the Feedback Vertex Set (FVS) problem, one is given an undirected graph G and an integer k, and o...
In the Feedback Vertex Set problem, one is given an undirected graph $G$ and an integer $k$, and one...
Given a graph G and an integer k, the Feedback Vertex Set (FVS) problem asks if there is a vertex se...
In the Feedback Vertex Set problem, one is given an undirected graph G and an integer k, and one nee...
The Feedback Vertex Set problem is undoubtedly one of the most well-studied problems in Parameterize...
Abstract. Given a graph G and an integer k, the FEEDBACK VERTEX SET (FVS) problem asks if there is a...
A feedback vertex set (FVS) of an undirected graph is a set of vertices that contains at l...
The NP-complete problem Feedback Vertex Set is to decide if it is possible, for a given integer k ≥ ...
Assuming the Unique Games Conjecture, we show strong inapproximability results for two natural verte...
The classical NP–hard feedback arc set problem (FASP) and feedback vertex set problem (FVSP) ask for...
We present a new parameterized algorithm for the feedback vertex set problem (fvs) on undirected gra...
We study feedback vertex sets (FVS) in tournaments, which are orientations of complete graphs. As ou...
We consider the minimum feedback vertex set problem for some bipartite graphs and degree-constrained...
Let G be a directed graph. A vertex set F is called feedback vertex set (FVS) if its removal from G ...
A feedback vertex set in a graph is a subset of vertices, such that the complement of this subset in...
In the Feedback Vertex Set (FVS) problem, one is given an undirected graph G and an integer k, and o...
In the Feedback Vertex Set problem, one is given an undirected graph $G$ and an integer $k$, and one...
Given a graph G and an integer k, the Feedback Vertex Set (FVS) problem asks if there is a vertex se...
In the Feedback Vertex Set problem, one is given an undirected graph G and an integer k, and one nee...
The Feedback Vertex Set problem is undoubtedly one of the most well-studied problems in Parameterize...
Abstract. Given a graph G and an integer k, the FEEDBACK VERTEX SET (FVS) problem asks if there is a...
A feedback vertex set (FVS) of an undirected graph is a set of vertices that contains at l...
The NP-complete problem Feedback Vertex Set is to decide if it is possible, for a given integer k ≥ ...
Assuming the Unique Games Conjecture, we show strong inapproximability results for two natural verte...
The classical NP–hard feedback arc set problem (FASP) and feedback vertex set problem (FVSP) ask for...
We present a new parameterized algorithm for the feedback vertex set problem (fvs) on undirected gra...
We study feedback vertex sets (FVS) in tournaments, which are orientations of complete graphs. As ou...
We consider the minimum feedback vertex set problem for some bipartite graphs and degree-constrained...
Let G be a directed graph. A vertex set F is called feedback vertex set (FVS) if its removal from G ...
DOI
Add to ORKG