553 search results - page 6 / 111 » Cover Contact Graphs |
DM
2006
13 years 9 months ago
2006
In this paper we continue our investigations from [HM01] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph G has a spann...
WEA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
ICRA
1999
IEEE
14 years 2 months ago
1999
IEEE
We presentthe first configurationspacecomputationalgorithm for pairs of rigid parts that move along fixed spatial axes. The motivation is contactanalysisformechanical design of sp...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
GC
2010
Springer
13 years 8 months ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...