### Table 1: Minimum Cost Network Flow Problems: Network Statistics.

2003

"... In PAGE 23: ...uns. The efficiency of the parallel code is discussed in the following section. We start with the presentation of numerical results obtained for the multicommodity network flow problems (15). In Table1 we report the characteristics of the networks: the numbers of nodes |V|, arcs |E| and demands |D|, respectively. In Table 2 we report the sizes of the resulting linear programs and the solution statistics: the numbers of iterations and the CPU time in seconds on SUN HPC.... ..."

Cited by 18

### Table 4: Experiments with NETGEN problems. The total supply used was 106, and the capacity range was [1,1000]. Each entry corresponds to an average over 3 problems. The entry in each box gives: Running time in seconds on a MacIIci Average number of flow changes per arc / Average number of price changes per node [Din70] Dinic, E. A., Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation, Soviet Math. Doklady, Vol. 11, pp. 1277-1280. 30

"... In PAGE 24: ... Table 3 compares AUCTION-MF with PFP-AO and PFP-DM on GRID-SQ problems. Table4 compares AUCTION-MF with PFP-AO and PFP-DM on NETGEN problems. Note that a * in these tables indicates that the corresponding problem was not run due to limited memory of the corresponding machine.... ..."

### Table 1. Random variables used to specify network flows

"... In PAGE 8: ... We have developed a flow-level simulator3 to analyze and compare the per- formance of different routing algorithms in a dynamic scenario. Our simulator makes use of several random variables to specify the characteristics of network flows ( Table1 ). For all the presented simulations, source and destination nodes are chosen uniformly among the set of edge nodes.... ..."

### Table 1: HAZOPS analysis of the evacuation list resource.

"... In PAGE 11: ... HAZOPs focuses discussion on the risk of problems occurring related to information flow, as well as aiding in the development of mitigation strategies. Table1 shows a HAZOPS description of the risks associated with the evacuation data information Resource. The guide words employed in the analysis are: never arrives, arrives late, arrives early, and arrives inaccuate.... ..."

Cited by 1

### Table 2: Minimum Cost Network Flow Problems: Solution Statistics.

2003

"... In PAGE 23: ... In Table 1 we report the characteristics of the networks: the numbers of nodes |V|, arcs |E| and demands |D|, respectively. In Table2 we report the sizes of the resulting linear programs and the solution statistics: the numbers of iterations and the CPU time in seconds on SUN HPC. Although we grouped the demands to keep the sizes of the problems as small as possible, some of them remained large and reached several hundred thousand variables.... ..."

Cited by 18

### TABLE I Summary of the Fifteen Algorithms Studied Abbreviation Implementation Description Complexity* Additional References

1998

Cited by 32

### TABLE I Uniform capacity of the five node ad-hoc network.

2003

Cited by 107

### TABLE I COMPARISON OF SPARE CAPACITY EFFICIENCY FOR NETWORK1

### Table 1. Time and space complexity of existing dynamic arc consistency algorithms.

2004

Cited by 4

### Table 4. Arcs for each algorithm

"... In PAGE 6: ... On the most of domains, the selective augmented Bayesian classifier is much faster than the SuperParent classifier. Table4 shows the number of arcs in the Bayesian network built by the SuperParent classifier (SP), the basic TAN classifier, and our (Select) on each domain, respectively. These experimental results show that the basic TAN al- ways tends to construct a tree including all attributes, the SP always tends to... ..."