### Table 4. An examination timetabling by the graph theory

"... In PAGE 7: ...Table4 also shows the final solution obtained by the graph theory. A1 1 4 3 8 7 2 5 6 A2 6 4 3 2 1 7 8 5 A3 1 2 4 3 5 6 7 8 A4 8 7 6 1 4 2 3 5 Fig.... ..."

### Table 2 Clustering coeSOcients of the market graph

2004

### Table 2. Application-related graphs: Register Allocation Graphs, sparse matrix graphs, exam scheduling graphs, latin square graph, and course scheduling graphs.

1993

"... In PAGE 14: ....2.1. Course Scheduling Graphs. (See Table2 .) For both course scheduling graphs, an optimal 14-coloring was found by Hybrid.... In PAGE 15: ....2.3. Register Allocation Graphs. (See Table2 .) The Saturation and RLF algorithms performed just as well as Hybrid on these graphs, and all algorithms halted quickly.... In PAGE 16: ....2.6. Latin Square Graph. (See Table2 .) All the algorithms performed poorly on this application.... ..."

Cited by 19

### Table 1: Event probabilities for causal structures Event Graph 0 Graph 1 Graph 2

2004

Cited by 4

### Table 1. Graphs from real applications.

"... In PAGE 6: ...ased symbolic graph algorithms as proposed, e. g., by [6] or [17], can be more efficient than traditional graph algorithms. 4 Graphs from real applications The graphs which we have considered in our investigations are listed in Table1 . The second and third columns give the number of vertices and the number of edges of the graphs, respectively.... In PAGE 6: ... The second and third columns give the number of vertices and the number of edges of the graphs, respectively. Note that all of the graphs listed in Table1 are sparse, i. e.... In PAGE 6: ...he vertices, e. g., that presented in [5]. 4Because all the graphs of Table1 are undirected ones, every undirected edge was substituted by two directed edges during the construction of their OBDDs. Therefore, the numbers of edges of the graphs in this figure are the doubles of that in Table 1.... ..."

### Table 1: Input Graphs

1997

"... In PAGE 9: ... 5 Experimental Results The experiments in Sections 5 and 6 were performed using ve di erent graphs arising in nite element applications. They are enumerated and described in Table1 . MeTiS was originally used on the input graphs to obtain a 128-way partition.... ..."

Cited by 57

### Table 1: Input Graphs

1997

"... In PAGE 9: ... 5 Experimental Results The experiments in Sections 5 and 6 were performed using ve di erent graphs arising in nite element applications. They are enumerated and described in Table1 . MeTiS was originally used on the input graphs to obtain a 128-way partition.... ..."

Cited by 57

### Table 2. Generated Application Call Graph

"... In PAGE 7: ....2. Accuracy. Table2 shows the size of the generated application call graph in terms of the number of call edges. Each call edge is a four- tuple lt; caller, call site, type, callee gt;, in which type can be either direct or callback.... ..."

### Table 3: Test graphs

2005

"... In PAGE 4: ... 4.1 Clustering of Benchmark Graphs Table3 lists 9 test graphs1 from various sources and dif- ferent application domains. Some of them are benchmark 1Downloaded from http://staffweb.... ..."

Cited by 14