390 search results - page 30 / 78 » Computing shortest paths for any number of hops |
205
click to vote
GC
2011
Springer
14 years 9 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
110
click to vote
ICDCSW
2005
IEEE
15 years 7 months ago
2005
IEEE
Many routing protocols for MANETs do not promote a balanced use of resources among the participating nodes, since they are designed to optimize other criteria, such as the number ...
IJRR
2008
15 years 1 months ago
2008
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximum speeds of the moving ob...
107
click to vote
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...
111
click to vote
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...