99 search results - page 2 / 20 » Directed Feedback Vertex Set Problem is FPT |
WALCOM
2010
IEEE
14 years 2 months ago
2010
IEEE
JACM
2008
13 years 7 months ago
2008
JCSS
2010
13 years 5 months ago
2010
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...
JCO
1998
13 years 7 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...