### Table 7.2 Performance of di erent techniques on the bipartite-graph model. Indirect GPVS Direct GPVS BG-model (FH) BG-model (onmetis) K

2004

Cited by 15

### Table 6.1: Taxonomy of graph generators: This table shows the graph types and degree distri- butions that different graph generators can create. The graph type can be undirected, directed, bipartite, allowing self-loops or multi-graph (multiple edges possible between nodes). The degree distributions can be power-law (with possible exponential cutoffs, or other deviations such as log- normal/DGX) or exponential decay. Empty cells indicate that the corresponding property does not occur in the corresponding model.

2005

Cited by 2

### Table 1: Examples of reaction classes used in interstellar chemistry and their reaction rates. The

2005

"... In PAGE 16: ...Directed bipartite graphUndirected substrate graph Figure 4: The representation of a reaction network generated for hydrogen using DNG and the reactions shown in Table1 . The blue/numbered nodes represent the reaction objects produced by the different reaction classes.... ..."

### Table 1 Main results for IMFP, IMCP and their subproblems IMFP IMCP UnSplitFlow CapPath EdgeDisjPath Multiterminal

2001

"... In PAGE 13: ....-C. Costa et al. / European Journal tiflow problems, and of their subproblems, is often in planar graphs, the multiterminal cut and inte- gral flow problems in acyclic graphs and the multicut and integral flow problems in directed trees. Finally, we would like to point out that there are still some interesting opened questions: what is the complexity of the two flow problem in directed bipartite graphs? Is it possible to approximate within a constant ratio the minimum multicut problem in unrestricted graphs? To conclude this survey, we give Table1 which summarizes the most significant results. References [1] R.... ..."

### Table 4. NMI of Bipartite Graph Clustering

in Abstract

"... In PAGE 6: ...Table 4. NMI of Bipartite Graph Clustering Table4 summarizes the results for the bipartite graph clustering. Again, the results indicate that refinement leads to better clustering.... ..."

### Table 1 instead of the bipartite graphs to be readable.

"... In PAGE 6: ... Eight and sixteen I/O transfers are applied for the first and second cases respectively. In each case, there are three patterns of I/O transfers as shown in Table1 . The edge tk=ei,j in Table 1 means a data (tk) is going to be transferred between the processor number i and disk number j.... In PAGE 6: ... t10 = e 23, t11= e 34, t12=e 54, t13=e 65, t14=e 67, t15=e 76, t16=e 87 16 8 6 t1=e 11, t2=e 22, t3=e 33, t4=e 44, t5=e 55, t6=e 66, t7=e 12, t8=e 21, t9=e 23, t10= e 34,t11= e 43, t12= e 54, t13= e 65, t14 = e75, t15= e73, t16= e 84 16 8 4 t1= e11, t2= e22, t3= e33, t4= e44, t5= e21, t6= e12, t7= e53, t8= e84, t9= e31, t10= e52, t11= e63, t12= e74, t13= e41, t14= e62, t15= e73, t16= e84 16 8 2 t1= e11, t2= e12, t3= e21, t4= e42, t5= e31, t6= e33, t7= e41, t8= e42, t9= e51, t10= e52, t11= e61, t12= e62, t13= e71, t14= e72, t15= e81, t16= e82 Table1 : No.... ..."

### Table 1: Results for bipartite graphs with |Vi| vertices per bipartition and |E| edges.

2003

"... In PAGE 10: ...158 Graphbase [11] that were used in the experiments of Mutzel [13, 14]2. The results of our experiments are shown alongside the results of Mutzel [14] in Table1 . Each row in the table corresponds to the average values from applying the algorithm to 100 different graphs3.... In PAGE 10: ... It is, however, meaningful to compare the shapes of the |E| versus running time graphs. In the first 17 rows of Table1 , we see that the FPT implementation is quite efficient up to |E| = 55, finding exact solutions to all input graphs. After |E| = 55, the FPT implementation is able to obtain exact solutions to only a few input graphs for the maximum time of 600 seconds (10 minutes) per graph.... In PAGE 10: ... 2We note that Theorem1 does not require the input graph G to be bipartite; consequently, our implementation is not limited to bipartite graphs. 3The graphs for the experiments corresponding to the first 17 rows of Table1 can be repro- duced using the Stanford Graphbase [11]. We first generate 1700 random integers beginning with seed 5841.... ..."

Cited by 4

### Table 2: Comparing partitioning results of uni-directional bipartitioning

1998

"... In PAGE 8: ...used to solve the scheduling problem and has the advantage of yielding much smaller net cuts. Table2 compares the number of uni-directional cut nets of bipartitioning by FBP-m #28when k = 2#29 with that of list scheduling. The number of levels in each of the two stages is set to be d depth 2 e and #0B is set to be w#28V #29 2 with #065#25 variation.... In PAGE 8: ... It is observed that our algorithm consistently achieved larger improvement on the larger circuits. Table2 also shows the CPU time for FBP- m. Since incremental #0Dow computation is employed, FBP-m is very e#0Ecient.... ..."

Cited by 17

### Table 6: NMI scores of the algorithms on bi-partite graphs

"... In PAGE 9: ... 6.2 Results and Discussion Table6 shows the NMI scores of the nine algorithms on the bi-partite graphs. For the BP-b1 graph, all the algo- rithms provide perfect NMI score, since the graphs are gen- erated with very clear structures, which can be seen from the parameter matrix in Table 2.... ..."