553 search results - page 26 / 111 » Cover Contact Graphs |
DAM
2008
14 years 10 months ago
2008
We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-mo...
92
Voted
AICCSA
2007
IEEE
15 years 4 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
ICRA
2002
IEEE
15 years 3 months ago
2002
IEEE
—We present new results on reconstruction of the shape and motion of an unknown object using tactile sensors without requiring objectimmobilization. Arobotmanipulatestheobjectwit...
107
Voted
FOCS
2002
IEEE
15 years 3 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
112
click to vote
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...