
Graphs
 Referenced in 107 articles
[sw12277]
 Shortestpath queries in static networks. We consider the pointtopoint (approximate) shortestpath ... singlesource (SSSP) and allpairs shortestpath (APSP) problems: we are first presented with ... this preprocessing step, applications may ask shortestpath or distance queries, which should be answered ... selected approaches, algorithms, and results on shortestpath queries from these fields, with the main...

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

Algorithm 360
 Referenced in 39 articles
[sw29819]
 Algorithm 360: shortestpath forest with topological ordering...

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

RelaxIV
 Referenced in 25 articles
[sw05172]
 based on a recently proposed auction/sequential shortest path algorithm. This initialization is shown...

ORtools
 Referenced in 17 articles
[sw14807]
 Sulum. Knapsack algorithms. Graph algorithms (shortest paths, min cost flow, max flow, linear sum assignment...

Theta*
 Referenced in 11 articles
[sw31693]
 edges can be longer than true shortest paths in the terrain since their headings ... guaranteed to find true shortest paths. AnglePropagation Theta* achieves a better worstcase complexity...

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...

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

OCOTILLO
 Referenced in 10 articles
[sw09292]
 general inverse problems based on shortestpath topological indices. Our results are superior both...

QuickMatch
 Referenced in 5 articles
[sw41111]
 QuickMatch is based on the successive shortest path (SSP) algorithm for the assignment problem, which ... performance of the standard successive shortest path algorithm by several orders of magnitude. We present...

D*Lite
 Referenced in 7 articles
[sw20991]
 search method that repeatedly determines a shortest path from the current robot coordinates...

KADABRA
 Referenced in 4 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...

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

XSnippet
 Referenced in 5 articles
[sw21710]
 than contextindependent 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 allpairs shortest paths for the weighted graph USAroadd.NY.gr ($n =264K ... 734K$), our implementation solved the shortest path distance labels in 44.4 seconds and the shortest...

Graph Theory
 Referenced in 4 articles
[sw28581]
 prove characterizations of Euler Trails, Shortest Paths and Kuratowski subgraphs...

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

TiML
 Referenced in 4 articles
[sw27564]
 list operations, merge sort, Dijkstra’s shortestpath algorithm, redblack trees, Braun trees, functional...