11381 search results - page 308 / 2277 » Connectivity |
140
click to vote
AICT
2006
IEEE
16 years 21 days ago
2006
IEEE
Communication in the face of intermittent, short-lived and unreliable connectivity can be difficult when relying solely on Internet protocols which have an implicit assumption of...
176
click to vote
AAIM
2005
Springer
16 years 5 days ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
149
click to vote
GD
2004
Springer
16 years 7 hour ago
2004
Springer
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...
181
click to vote
ICALP
2004
Springer
16 years 4 hour ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
155
click to vote
SAINT
2003
IEEE
15 years 12 months ago
2003
IEEE
Vehicle environment is a good testbed to investigate Internet mobility technologies. Based on testing of building, protocol implementation details and problems to deploy it will b...