Sciweavers

552 search results - page 23 / 111
» Constrained Shortest Path Computation
Sort
View
IPPS
2007
IEEE
14 years 4 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
ICN
2005
Springer
14 years 3 months ago
Fault Free Shortest Path Routing on the de Bruijn Networks
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classi...
Ngoc Chi Nguyen, Vo Dinh Minh Nhat, Sungyoung Lee
ICDCS
2012
IEEE
12 years 2 days ago
Optimal Recovery from Large-Scale Failures in IP Networks
—Quickly recovering IP networks from failures is critical to enhancing Internet robustness and availability. Due to their serious impact on network routing, large-scale failures ...
Qiang Zheng, Guohong Cao, Tom La Porta, Ananthram ...
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
13 years 7 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
SODA
2007
ACM
131views Algorithms» more  SODA 2007»
13 years 11 months ago
On the K-simple shortest paths problem in weighted directed graphs
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Liam Roditty