Results 1  10
of
1,097,771
Feedback Vertex Sets in Tournaments
, 2010
"... We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs. On the combinatorial side, we derive strong upper and lower bounds on the maximum number of minimal feedback vertex sets in an nvertex tournament. We prove that every tournament on n vertices ..."
Abstract
 Add to MetaCart
We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs. On the combinatorial side, we derive strong upper and lower bounds on the maximum number of minimal feedback vertex sets in an nvertex tournament. We prove that every tournament on n vertices
Feedback Vertex set and longest . . .
"... We present a polynomial time algorithm to compute a minimum (weight) feedback vertex setfor ATfree graphs, and extending this approach we obtain a polynomial time algorithm for graphs of bounded asteroidal number.We also present an O(nm²) algorithm to ..."
Abstract
 Add to MetaCart
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex setfor ATfree graphs, and extending this approach we obtain a polynomial time algorithm for graphs of bounded asteroidal number.We also present an O(nm²) algorithm to
Parameterized algorithms for feedback vertex set
 in Proc. 1st Int. Workshop on Parameterized and Exact Computation, IWPEC 2004
"... Abstract. We present an algorithm for the parameterized feedback vertex set problem that runs in time O((2 lg k + 2 lg lg k + 18) k n 2). This improves the previous O(max{12 k, (4 lg k) k}n ω) algorithm by Raman et al. by roughly a 2 k factor (n w ∈ O(n 2.376) is the time needed to multiply two n × ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Abstract. We present an algorithm for the parameterized feedback vertex set problem that runs in time O((2 lg k + 2 lg lg k + 18) k n 2). This improves the previous O(max{12 k, (4 lg k) k}n ω) algorithm by Raman et al. by roughly a 2 k factor (n w ∈ O(n 2.376) is the time needed to multiply two n
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 onnvertices contains a feedback vertex set (FVS) of size at mostk, in time47.5 k ·k!·O(n 4). This is the first fixed parameter tractable algorithm for FVS that ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. A mixed graph is a graph with both directed and undirected edges. We present an algorithm for deciding whether a given mixed graph onnvertices contains a feedback vertex set (FVS) of size at mostk, in time47.5 k ·k!·O(n 4). This is the first fixed parameter tractable algorithm for FVS
Improved algorithms for the feedback vertex set problems
, 2007
"... We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5 k kn 2). For unweighted graphs, our algorithm either constructs a feedback vertex set of size bounded by k in a given graph G, or reports that no s ..."
Abstract

Cited by 42 (9 self)
 Add to MetaCart
We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5 k kn 2). For unweighted graphs, our algorithm either constructs a feedback vertex set of size bounded by k in a given graph G, or reports
A cubic kernel for feedback vertex set
, 2006
"... Abstract. In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, when given a graph G andanintegerk, finds a graph H and integer k ′ ≤ k, such that H has a feedback vertex set ..."
Abstract

Cited by 27 (6 self)
 Add to MetaCart
Abstract. In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, when given a graph G andanintegerk, finds a graph H and integer k ′ ≤ k, such that H has a feedback vertex
Enumerating Minimal Subset Feedback Vertex Sets
"... Abstract. The Subset Feedback Vertex Set problem takes as input a weighted graph G and a vertex subset S of G, andthetaskis to find a set of vertices of total minimum weight to be removed from G such that in the remaining graph no cycle contains a vertex of S. This problem is a generalization of two ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. The Subset Feedback Vertex Set problem takes as input a weighted graph G and a vertex subset S of G, andthetaskis to find a set of vertices of total minimum weight to be removed from G such that in the remaining graph no cycle contains a vertex of S. This problem is a generalization
Directed Feedback Vertex Set problem is FPT
 DAGSTUHL SEMINAR SERIES, SEMINAR 07281 (2007), AVAILABLE ELECTORNICALLY AT HTTP://KATHRIN.DAGSTUHL.DE/FILES/MATERIALS/07/07281/ 07281.CHENJIANER.PAPER.PDF
, 2007
"... To decide if the parameterized feedback vertex set problem in directed graph is fixedparameter tractable is a long standing open problem. In this paper, we prove that the parameterized feedback vertex set in directed graph is fixedparameter tractable and give the first FPT algorithm of running ti ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
To decide if the parameterized feedback vertex set problem in directed graph is fixedparameter tractable is a long standing open problem. In this paper, we prove that the parameterized feedback vertex set in directed graph is fixedparameter tractable and give the first FPT algorithm of running
Feedback vertex set on ATfree graphs
, 2007
"... We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for ATfree graphs, and extending this approach we obtain a polynomial time algorithm for graphs of bounded asteroidal number. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for ATfree graphs, and extending this approach we obtain a polynomial time algorithm for graphs of bounded asteroidal number.
Minimum Feedback Vertex Set in kDimensional Hypercubes
, 1999
"... In this paper we nd upper and lower bounds to the size of the feedback vertex set for kdimensional hypercubes. Given a graph, the minimum feedback vertex set problem consists of finding a subset of vertices of minimum size whose removal induces an acyclic subgraph. The problem is NPhard for gener ..."
Abstract
 Add to MetaCart
In this paper we nd upper and lower bounds to the size of the feedback vertex set for kdimensional hypercubes. Given a graph, the minimum feedback vertex set problem consists of finding a subset of vertices of minimum size whose removal induces an acyclic subgraph. The problem is NP
Results 1  10
of
1,097,771