266 search results - page 32 / 54 » Graphs with Bounded Induced Distance |
ICALP
2003
Springer
14 years 2 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
IM
2008
13 years 9 months ago
2008
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
ALGORITHMICA
2011
13 years 4 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
Rapidly deployable wireless networks consist of mobile base stations and less powerful mobile hosts. The mobile base stations have to maintain wireless connectivity while on the mo...