Searching for "A Generalization of Dijkstra's Algorithm." – sorted by Relevance.
-
Algebra and Algorithms for QoS Path Computation and Hop-by-Hop Routing in the Internet
- is both necessary and sufficient for a generalized Dijkstra’s algorithm to yield optimal paths. Likewise
- Cited by 41 (1 self) – Add To MetaCart
-
Temporal properties of low power wireless links: Modeling and implications on multi-hop routing
- generalized Dijkstra algorithm with centralized execution, and (ii)a localized distributed probabilistic
- Cited by 25 (0 self) – Add To MetaCart
-
Generalizing Dijkstra's Algorithm and Gaussian Elimination for Solving MDPs
- : Dijkstra’s algorithm, in a notation which will allow us to generalize it to stochastic MDPs. The variable
- Cited by 2 (0 self) – Add To MetaCart
-
Resource Allocation in Switchlets Networks
- S requirements of a VPN are taken into account. A generalization of the Dijkstra algorithm was used to find the k
- Add To MetaCart
-
Advanced OR and AI Methods in Transportation
- -dependent shortest path problem Dreyfus [2] has first proposed a generalization of Dijkstra algorithm to solve
- Add To MetaCart
-
Space and Time Efficient Self-Stabilizing l-Exclusion in Tree Networks
- for the `-exclusion problem was presented in [9]. This solution is a generalization of Dijkstra's algorithm [5
- Add To MetaCart
-
Multi-modal traffic in TRANSIMS
- search graph such that a generalized Dijkstra algorithm can be used to find a "best" multi-modal path
- Cited by 2 (0 self) – Add To MetaCart
-
Optimal Traversal of Directed Hypergraphs
- introduced by Knuth [Knu77] in the context of a generalization of Dijkstra's algorithm to context
- Cited by 12 (2 self) – Add To MetaCart

