### Table 5 Statistics describing the occurrence of correct pronunciations among the shortest paths of

2000

Cited by 13

### Table II (objectives problem models) Superscripts pre: preprocessing time, 2: rectangular obstacles, Q1j2: query types. Query version within a simple paths on given given obstacles rectilinear n segments polygon (Manhattan Path)

1996

Cited by 22

### Table 1: Time needed for L1-, rectilinear link distance, and smallest path queries.

1996

"... In PAGE 2: ...ength. His data structure needs O(n log n) space and preprocessing. We summarize the results in the following table (k is used to denote the link length of the shortest path). In this paper we present a data structure that achieves the same time complexities as shown in Table1 but improves both the space and prepro- cessing requirements to linear in the number of vertices of the polygon.... ..."

Cited by 5

### Table 3. Searching the Shortest Paths.

2001

Cited by 3

### Table 3. Searching the Shortest Paths.

2001

Cited by 3

### Table 2. Shortest Path Table

"... In PAGE 5: ... 3. Graph representation for function (6) Table2 summarizes the SP of this graph. NP, NN, SSP, and MNNAP are summarized in Table 3.... ..."

### Table 1. Output of k-shortest paths computation for k=3 Shortest path Total weight Path

"... In PAGE 2: ... If the directed graph in Fig. 1 is taken as an input, the output of the k-shortest path computation is listed in Table1 . In this table, as an example, the parameter of k is 4, meaning that the output of the computation consists of the first shortest path, the second shortest path, the third shortest path, and the fourth shortest path.... In PAGE 3: ... DNA sequence design and synthesis Consider a directed graph and the output of the shortest path computation as shown in Fig. 1 and Table1 respectively. Let n be the total number of nodes in the graph.... ..."

### Table 3: Parallel Shortest Path Algorithm

1997

"... In PAGE 4: ... Our parallel shortest path algorithm uses the SPMD model for which each processor solves the portion of the shortest path tree on its subnetwork for each source. The outline of the algorithm is given in Table3 . Each processor repeatedly solves for shortest paths for its assigned subnetwork.... ..."

Cited by 7

### Table 3: Parallel Shortest Path Algorithm

1997

"... In PAGE 4: ... Our parallel shortest path algorithm uses the SPMD model for which each processor solves the portion of the shortest path tree on its subnetwork for each source. The outline of the algorithm is given in Table3 . Each processor repeatedly solves for shortest paths for its assigned subnetwork.... ..."

Cited by 7

### Table 1 - Comparison of representations for shortest path finding

"... In PAGE 6: ...A comparison of representations for shortest path finding is shown in Table1 . As described above, the conventional representation has the possibility of yielding incorrect shortest paths.... ..."