266 search results - page 16 / 54 » Graphs with Bounded Induced Distance |
COMBINATORICS
2002
14 years 11 months ago
2002
Let G = (V, E) be a connected undirected graph and S a subset of vertices. If for all vertices v V , the sets Br(v) S are all nonempty and different, where Br(v) denotes the set...
COMBINATORICS
1999
14 years 11 months ago
1999
Let G = (V, E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v V , the neighbouring set N(v, C) is the set of vertices of C at d...
113
click to vote
CORR
2011
Springer
14 years 6 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...
CCCG
2004
15 years 1 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
100
click to vote
JDA
2010
14 years 6 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...