390 search results - page 35 / 78 » Computing shortest paths for any number of hops |
AROBOTS
2007
15 years 2 months ago
2007
The process of protein crystallization is explained using the theory of robotics, particularly path planning of mobile robots. Path planning is a procedure which specifies motion ...
142
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
114
click to vote
OPODIS
2008
15 years 3 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
101
click to vote
BROADNETS
2006
IEEE
15 years 8 months ago
2006
IEEE
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...
133
click to vote
PODC
1997
ACM
15 years 6 months ago
1997
ACM
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...