• lop.gms

  • Referenced in 3 articles [sw29936]
  • possible lines is defined by the shortest paths in the rail network...
  • EmptyHeaded

  • Referenced in 3 articles [sw32535]
  • pattern queries, PageRank, and Single-Source Shortest Paths (SSSP) and is an order of magnitude...
  • ShortestPath

  • Referenced in 1 article [sw32236]
  • Axiomatic Characterization of the Single-Source Shortest Path Problem. This theory is split into ... axiomatic characterization of the single-source shortest path problem is correct. Namely, we prove that ... edges the single-source shortest path function is the only function that satisfies ... axiomatic characterization of the single-source shortest path problem for directed graphs with general cost...
  • cspy

  • Referenced in 2 articles [sw33031]
  • algorithms to solve the (resource) Constrained Shortest Path (CSP) problem. The CSP problem has been...
  • D* Extra Lite

  • Referenced in 2 articles [sw20992]
  • frontier-gap repairing. Searching for the shortest-path in an unknown or changeable environment...
  • Anya

  • Referenced in 2 articles [sw31694]
  • goal is to find a shortest path between a pair of points on a grid...
  • Skil

  • Referenced in 2 articles [sw26451]
  • basis of skeletons, namely shortest paths in graphs and Gaussian elimination. Run time measurements show...
  • net.datastructures

  • Referenced in 2 articles [sw12789]
  • graphs, their traversals, and applications, (e.g. shortest paths). The package was designed for educational...
  • BPA

  • Referenced in 2 articles [sw23806]
  • problems consist in determining the optimal shortest path, or at least one path, between...
  • ttcrpy

  • Referenced in 1 article [sw40257]
  • implemented: the Fast-Sweeping Method, the Shortest-Path Method, and the Dynamic Shortest-Path Method...
  • EDAS

  • Referenced in 1 article [sw02764]
  • SPMS is its use of the shortest path to minimize energy consumption. However, since ... repeatedly uses the same shortest path and, hence, reduces energy consumption, it is impossible...
  • SPFF

  • Referenced in 1 article [sw03497]
  • disk requests to obtain an algorithm, Shortest Path First-fit First (SPFF). This algorithm ... based on the shortest path of disk head motion constructed by all the pendent requests...
  • RevTree

  • Referenced in 1 article [sw37680]
  • approximation for the resource constrained shortest path problem. .. 2. RevTree algorithm: The RevTree algorithm ... which is used to solve the shortest path problem [9]. Dijkstra’s algorithm uses...
  • CciMST

  • Referenced in 1 article [sw31403]
  • inconsistent edge is located on the shortest path between the cluster centers ... densities of their endpoints on the shortest path. Correspondingly, we obtain two groups of clustering...
  • COStar

  • Referenced in 1 article [sw28651]
  • algorithm is used to compute the shortest path from the start site to the target ... search in real-time for a shortest path in a generated graph. Using in silico...
  • Quickgraph

  • Referenced in 1 article [sw09943]
  • file compilation order, network band-with, shortest path, etc. The library provides the basic data ... depth-first-search, the Dijkstra shortest path, etc. As the library comes with a full...
  • MPLCP

  • Referenced in 1 article [sw37888]
  • Shortest path distance in Manhattan Poisson line Cox process. While the Euclidean distance characteristics ... literature, the analytical characterization of the path distances is still an open problem. In this ... length of the shortest path to the nearest point of the MPLCP in the sense...
  • treeOclock

  • Referenced in 1 article [sw38936]
  • epidemiology, the computational complexity of the shortest path problem for these trees remained unsolved ... phylogenetic tree rearrangement operation for which shortest paths, and hence the distance, can be computed...
  • HAGAR

  • Referenced in 1 article [sw02336]
  • vertex reachability, transitive closure, and shortest path, are fundamental in many computing applications. We address ... HAGAR implementations for graph reachability and shortest path. Reachability is a building block that...
  • Terracost

  • Referenced in 1 article [sw20477]
  • from our previous work on I/O-efficient shortest paths on grids and uses O(sort...