1729 search results - page 241 / 346 » Bound Graph Polysemy |
166
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
172
Voted
DM
2007
15 years 6 months ago
2007
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
152
click to vote
ENDM
2007
15 years 6 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
157
Voted
TCS
2008
15 years 6 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
190
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...