686 search results - page 41 / 138 » Packing Cycles in Graphs |
129
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
140
Voted
EJC
2008
15 years 2 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
162
Voted
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
120
Voted
ICPR
2010
IEEE
15 years 23 days ago
2010
IEEE
We present a method for object tracking over time sequence imagery. The image plane is represented with a 4-connected planar graph where vertices are associated with pixels. On ea...
141
Voted
IWPEC
2004
Springer
15 years 8 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...