553 search results - page 28 / 111 » Cover Contact Graphs |
99
Voted
IPL
2010
14 years 5 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout e orts. We introduce in this paper a novel method for ident...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— In this paper, we describe the design of a deformable robot with a tensegrity structure that can crawl and we show the results of experiments showing the ability of the...
91
Voted
WADS
2005
Springer
15 years 3 months ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
75
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...