553 search results - page 35 / 111 » Cover Contact Graphs |
LATIN
2004
Springer
15 years 4 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
68
Voted
ICRA
2005
IEEE
15 years 4 months ago
2005
IEEE
— This paper proposes a necessary and sufficient condition for parallel grasps. We extend the use of this condition to the task of regrasp planning. In particular, we propose a ...
AISADM
2005
Springer
15 years 4 months ago
2005
Springer
The paper presents peer-to-peer multi-agent framework for community clustering based on contact propagation in the global network of contacts with individual ontology-based descrip...
DSN
2004
IEEE
15 years 2 months ago
2004
IEEE
If we limit the contact rate of worm traffic, can we alleviate and ultimately contain Internet worms? This paper sets out to answer this question. Specifically, we are interested ...
154
click to vote
DC
2011
13 years 10 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...