1414 search results - page 53 / 283 » Cover Time and Broadcast Time |
DCOSS
2008
Springer
13 years 11 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
AROBOTS
2004
13 years 9 months ago
2004
Robotics researchers have studied robots that can follow trails laid by other robots. We, on the other hand, study robots that leave trails in the terrain to cover closed terrain r...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
ICIP
2006
IEEE
14 years 11 months ago
2006
IEEE
The primary goal of image steganography techniques has been to maximize embedding rate while minimizing the detectability of the resulting stego images against steganalysis techni...
MST
2007
13 years 9 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...