Search Sciweavers | Sciweavers

866 search results - page 19 / 174

» On Dynamic Shortest Paths Problems

click to vote

CNSR
2010
IEEE

140views Communications» more CNSR 2010»

Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2

13 years 11 months ago

Download www.herberg.name

—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...

Ulrich Herberg

claim paper

Read More »

click to vote

WEA
2009
Springer

145views Algorithms» more WEA 2009»

Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study

14 years 2 months ago

Download i11www.iti.uni-karlsruhe.de

A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...

Reinhard Bauer, Dorothea Wagner

claim paper

Read More »

click to vote

ICC
2007
IEEE

117views Communications» more ICC 2007»

New Parallel Shortest Path Searching Algorithm based on Dynamically Reconfigurable Processor DAPDNA-2

14 years 1 months ago