390 search results - page 20 / 78 » Computing shortest paths for any number of hops |
118
click to vote
SIAMDM
2010
14 years 8 months ago
2010
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
114
Voted
IPL
2010
15 years 10 days ago
2010
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
118
click to vote
MOBIHOC
2003
ACM
16 years 1 months ago
2003
ACM
We develop a detailed approach to study how mobilityimpacts the performance of reactive MANET routing protocols. In particular we examine how the statistics of path durations inclu...
114
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
106
click to vote
MUE
2008
IEEE
15 years 8 months ago
2008
IEEE
The route guidance system, which provides driving advice based on traffic information about an origin and a destination, has become very popular along with the advancement of hand...