Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Bidirectional dijkstra"”.

  1. Explaining the Performance of Bidirectional Dijkstra and A* on Road Networks

    … networks community, however, often build upon Dijkstra's algorithm and use Bidirectional Dijkstra's algorithm as their baseline. This thesis investigates the performance of A* and Bidirectional Dijkstra in road networks to see how they compare and to see if there is a principled explanation for …

    denver Repository record for Explaining the Performance of Bidirectional Dijkstra and A* on Road Networks (opens in a new tab)

  2. Efficient Algorithms for Solving Size-Shape-Topology Truss Optimization and Shortest Path Problems

    … a given dynamic network. Finally, an efficient bidirectional Dijkstra shortest path (SP) heuristic algorithm is also proposed. Extensive numerical examples have been conducted in this study to validate the effectiveness and the robustness of the proposed three numerical algorithms.

    odu Repository record for Efficient Algorithms for Solving Size-Shape-Topology Truss Optimization and Shortest Path Problems (opens in a new tab)