• Graphs

  • Referenced in 104 articles [sw12277]
  • Shortest-path queries in static networks. We consider the point-to-point (approximate) shortest-path ... single-source (SSSP) and all-pairs shortest-path (APSP) problems: we are first presented with ... this preprocessing step, applications may ask shortest-path or distance queries, which should be answered ... selected approaches, algorithms, and results on shortest-path queries from these fields, with the main...
  • e1071

  • Referenced in 92 articles [sw07985]
  • transform, fuzzy clustering, support vector machines, shortest path computation, bagged clustering, naive Bayes classifier...
  • RELAX4

  • Referenced in 39 articles [sw10531]
  • initialization based on an auction/sequential shortest path algorithm. This initialization is shown to be extremely...
  • RelaxIV

  • Referenced in 24 articles [sw05172]
  • based on a recently proposed auction/sequential shortest path algorithm. This initialization is shown...
  • Dijkstra Shortest Path

  • Referenced in 9 articles [sw28550]
  • Dijkstra’s Shortest Path Algorithm. We implement and prove correct Dijkstra’s algorithm ... single source shortest path problem, conceived in 1956 by E. Dijkstra. The algorithm is implemented...
  • Theta*

  • Referenced in 7 articles [sw31693]
  • edges can be longer than true shortest paths in the terrain since their headings ... guaranteed to find true shortest paths. Angle-Propagation Theta* achieves a better worst-case complexity...
  • OCOTILLO

  • Referenced in 10 articles [sw09292]
  • general inverse problems based on shortest-path topological indices. Our results are superior both...
  • OR-tools

  • Referenced in 7 articles [sw14807]
  • Sulum. Knapsack algorithms. Graph algorithms (shortest paths, min cost flow, max flow, linear sum assignment...
  • D*Lite

  • Referenced in 6 articles [sw20991]
  • search method that repeatedly determines a shortest path from the current robot coordinates...
  • Castor

  • Referenced in 5 articles [sw31129]
  • framework for Java. It’s the shortest path between Java objects, XML documents and relational...
  • Traffic 4

  • Referenced in 5 articles [sw12635]
  • compute some interesting properties (e.g. the shortest path from one station to another...
  • graph2vec

  • Referenced in 5 articles [sw32340]
  • graph kernels use handcrafted features (e.g., shortest paths, graphlets, etc.) and hence are hampered...
  • XSnippet

  • Referenced in 5 articles [sw21710]
  • than context-independent heuristics such as shortest path and frequency. Our experimental evaluation has shown...
  • NETAL

  • Referenced in 2 articles [sw06628]
  • been paid to centrality metrics using shortest paths, which require a comparatively smaller amount ... targets extremely important kernel types called shortest paths and centrality. Our implementation, called NETAL (NETwork ... previous implementations. In the all-pairs shortest paths for the weighted graph USA-road-d.NY.gr ($n =264K ... 734K$), our implementation solved the shortest path distance labels in 44.4 seconds and the shortest...
  • EmptyHeaded

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

  • Referenced in 2 articles [sw25810]
  • first contribution focuses on sampling shortest paths, a subroutine used by most algorithms that approximate ... approach decreases the total number of shortest paths that need to be sampled to compute...
  • RNAspa

  • Referenced in 2 articles [sw17131]
  • RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules ... vertices in a graph. The shortest path in this graph is the basis for structural...
  • lop.gms

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