Sciweavers

425 search results - page 5 / 85
» A Fully Dynamic Algorithm for Distributed Shortest Paths
Sort
View
INFORMS
2008
44views more  INFORMS 2008»
13 years 7 months ago
Speeding Up Dynamic Shortest-Path Algorithms
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...
COMCOM
2000
96views more  COMCOM 2000»
13 years 7 months ago
A routing algorithm for dynamic multicast trees with end-to-end path length control
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
Hiroshi Fujinoki, Kenneth J. Christensen
HIPC
2007
Springer
14 years 1 months ago
Accelerating Large Graph Algorithms on the GPU Using CUDA
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
Pawan Harish, P. J. Narayanan
IPPS
2007
IEEE
14 years 1 months ago
On Achieving the Shortest-Path Routing in 2-D Meshes
In this paper, we present a fully distributed process to collect and distribute the minimal connected component (MCC) fault information so that the shortest-path between a source ...
Zhen Jiang, Jie Wu