Results 1 - 10 of 49,527

Table 2. Results for dynamic shortest-path queries. Dynamic Shortest Paths Query Type Query Space Update

in Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside A Simple Polygonal Obstacle
by Yi-jen Chiang, Roberto Tamassia

Table 1: Shortest Path Problems Classification

in Optimal Routing in Gossip Networks
by Yuval Shavitt And, Yuval Shavitt, Amir Shay 2005
Cited by 3

Table 2. Shortest Path Problem Connection matrix

in Cost-Based Filtering for Stochastic Inventory Control
by S. Armagan Tarim, Brahim Hnich, Roberto Rossi, Steven Prestwich 2007
Cited by 1

Table 9 Shortest Path Problem Connection matrix

in Manuscript Click here to download Manuscript: tarim_cost_based_filtering.tex 1 2 3 4 5 6 7 8
by unknown authors

Table 3 Shortest-path running times

in Using Software Complexity Measures to Analyze Algorithms - an Experiment With the Shortest-Paths Algorithm
by Jukka Nurminen
"... In PAGE 7: ...1. Shortest-path algorithms We have collected the running times, from [12] in Table3 (the largest problem instances only). 13 Table 4 contains the ranking of the algorithms based on their running times.... ..."

Table 3 Shortest-path running times

in Available Online At Www.sciencedirect.com
by Computers Operations Research, Jukka K. Nurminen
"... In PAGE 7: ...1. Shortest-path algorithms We have collected the running times, from [12] in Table3 (the largest problem instances only). Table 4 contains the ranking of the algorithms based on their running times.... ..."

Table 3.1 Results for static shortest-path queries. Dynamic Shortest Paths Query Type Query Space Update

in Trace Size vs Parallelism in Trace-and-Replay . . .
by Robert H. B. Netzer

Table 3.1 Results for static shortest-path queries. Dynamic Shortest Paths Query Type Query Space Update

in Dynamic and I/O-Efficient Algorithms for Computational Geometry and Graph Problems: Theoretical and Experimental Results
by Yi-Jen Chiang

Table 1: Possible edit distances for the shortest path problem

in
by unknown authors
"... In PAGE 4: ... The distance between p1 and p2 should reflect this. Table1 shows the possible edit distances (assuming all weights are equal to one). Table 1: Possible edit distances for the shortest path problem... ..."

Table VI. All pairs shortest paths problem (execution times in seconds)

in A comparison of two paradigms for distributed shared memory
by Willem G. Levelt, M. Frans Kaashoek, Henri E. Bal, Andrew S. Tanenbaum 1992
Cited by 27
Results 1 - 10 of 49,527