4255 search results - page 13 / 851 » Cover |
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
SODA
2003
ACM
13 years 8 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
ALGORITHMICA
2010
13 years 7 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
JDA
2008
13 years 7 months ago
2008
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
JMIV
2008
13 years 7 months ago
2008
Abstract. In this paper we classify digital covering spaces using the conjugacy class corresponding to a digital covering space.