4255 search results - page 14 / 851 » Cover |
AAIM
2007
Springer
15 years 6 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
An edge cover C of an undirected graph is a set of edges such that every vertex has an adjacent edge in C. We show that a Glauber dynamics Markov chain for edge covers mixes rapidl...
105
click to vote
DM
2007
14 years 11 months ago
2007
We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it...
RSA
2008
14 years 11 months ago
2008
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
CIDU
2010
14 years 9 months ago
2010
Ecosystem-related observations from remote sensors on satellites offer huge potential for understanding the location and extent of global land cover change. This paper presents a c...