134 search results - page 2 / 27 » Speeding Up Dynamic Shortest-Path Algorithms |
CNSR
2010
IEEE
13 years 9 months ago
2010
IEEE
—MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constr...
AAIM
2008
Springer
13 years 7 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
ESA
2004
Springer
13 years 10 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
PPSN
2010
Springer
13 years 3 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
ISCAPDCS
2003
13 years 6 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...