### Table 1: Maximal matchings for the search graph G

### Table 1. Recognition results from various gait masks.

2001

"... In PAGE 3: ... Since the subject may start his walking cycle at a different point, the graphs are compared at all possible shifts along the axis and the maximal correlation is taken. Table1 shows the recognition rates of various... ..."

Cited by 2

### Table 7-2. Maximal cliques contained in graphs with density as 10%

2007

"... In PAGE 9: ...able 4-1. Summary of selected SNA metrics. ...................................................60 Table7 -1.... In PAGE 9: ...able 7-1. Maximal cliques contained in each graph ........................................126 Table7 -2.... In PAGE 9: ...able 7-2. Maximal cliques contained in graphs with density as 10%...............130 Table7 -3.... In PAGE 9: ...able 7-3. Maximal cliques contained in graphs with density as 15%...............130 Table7... In PAGE 135: ...ntroduced in chapter 4.6) to compare with. By running the serial algorithm, we obtain the number of maximal cliques contained in each graph. The number of maximal cliques for each graph is shown in Table7 -1. For all the graphs from size 5000 to 30000 and from Density I to Density III, there is no maximal cliques with size larger than 3.... In PAGE 135: ... For all the graphs from size 5000 to 30000 and from Density I to Density III, there is no maximal cliques with size larger than 3. Table7 -1 Maximal cliques contained in each graph graph size Density I Density II Density III 5000 9975 / 11 19738 / 86 38332 / 559 10000 19970 / 6 39705 / 96 77941 / 684 15000 29972 / 5 59739 / 66 103656 / 443 20000 40955 / 7 80746 / 82 171706 / 595 25000 51964 / 6 104735 / 86 202898 / 690 30000 62941 / 11 121737 / 85 241944 / 677 In this table, the value before / is the number of maximal 2-cliques contained in the graph. The value after this symbol is the number of maximal 3-cliques.... In PAGE 135: ... The value after this symbol is the number of maximal 3-cliques. As shown in Table7 -1, graphs with Density I have very small number of maximal 3- cliques because of the low density. The time costs for finding all maximal cliques contained in each graph by the serial algorithm and our parallel approach are shown in Figure 7-14.... In PAGE 139: ... Table7 -3. Maximal cliques contained in graphs with density as 15% n \ M 2 3 4 5 6 400 5 9348 7465 322 1 500 4 14075 16563 854 9 600 0 17662 34032 2235 11 700 21566 59500 4783 46 800 0 25033 95314 8348 88 Table 7-4.... In PAGE 139: ...Table 7-3. Maximal cliques contained in graphs with density as 15% n \ M 2 3 4 5 6 400 5 9348 7465 322 1 500 4 14075 16563 854 9 600 0 17662 34032 2235 11 700 21566 59500 4783 46 800 0 25033 95314 8348 88 Table7 -4. Maximal cliques contained in graphs with density as 20% n \ M 2 3 4 5 6 7 400 0 5538 25039 3692 67 0 500 0 5944 54132 10622 240 0 600 0 5677 100269 26182 678 2 700 0 5229 164267 50644 1400 4 800 0 4229 151391 101710 3513 15 From these tables we can see that the maximal cliques with middle size are the major part.... ..."

### Table 3: Maximal or-matchings for query graph G

"... In PAGE 12: ...Thus, whenever x is bound in a weak matching, then it is bound to the chairman of the department. Table3 shows the set of maximal or-matchings for the query graph in Figure 3. For terminal nodes, wehave listed the attached atoms instead of the identity of the object.... ..."

### Table 7.2: Recognition rate results for Sonar database FSS Maximal Criterion Value Maximal LOO Accuracy

2006

### Table 1: Recognition for the Buddy Scheme in Star Graphs

### Table 1: Recognition for the Buddy Scheme in Star Graphs

### Table 2: Maximal answers of Q

"... In PAGE 10: ...erson is the instructor in x5. Thus, we declare x1, x2, x3 x4, x5 as output variables. Let Q 1 =#28G 1 ;F 1 ;#16 x#29 be the query, where G 1 is the query graph in Figure 2, F 1 = f!yg, and #16 x =#28x1;x2;x3;x4;x5#29. Table2 shows the maximal answers to Q 1 under and and weak semantics. We see that under and-semantics, we receive the one person who teaches a course and is also a lab instructor, together with the information about the course and the information about the lab.... ..."

### Table 7-1 Maximal cliques contained in each graph graph size Density I Density II Density III

2007

"... In PAGE 9: ...able 4-1. Summary of selected SNA metrics. ...................................................60 Table7 -1.... In PAGE 9: ...able 7-1. Maximal cliques contained in each graph ........................................126 Table7 -2.... In PAGE 9: ...able 7-2. Maximal cliques contained in graphs with density as 10%...............130 Table7 -3.... In PAGE 9: ...able 7-3. Maximal cliques contained in graphs with density as 15%...............130 Table7... In PAGE 135: ...ntroduced in chapter 4.6) to compare with. By running the serial algorithm, we obtain the number of maximal cliques contained in each graph. The number of maximal cliques for each graph is shown in Table7 -1. For all the graphs from size 5000 to 30000 and from Density I to Density III, there is no maximal cliques with size larger than 3.... In PAGE 135: ... The value after this symbol is the number of maximal 3-cliques. As shown in Table7 -1, graphs with Density I have very small number of maximal 3- cliques because of the low density. The time costs for finding all maximal cliques contained in each graph by the serial algorithm and our parallel approach are shown in Figure 7-14.... In PAGE 139: ... This is shown in Tables 7-2, 7-3, and 7-4 where n and M represent graph size and maximal clique size respectively. Table7 -2. Maximal cliques contained in graphs with density as 10% n \ M 2 3 4 5 6 400 186 6604 943 7 0 500 154 11377 2364 30 0 600 86 18091 4479 40 1 700 46 26342 8838 123 0 800 45 36056 13118 215 2 Table 7-3.... In PAGE 139: ... Table 7-2. Maximal cliques contained in graphs with density as 10% n \ M 2 3 4 5 6 400 186 6604 943 7 0 500 154 11377 2364 30 0 600 86 18091 4479 40 1 700 46 26342 8838 123 0 800 45 36056 13118 215 2 Table7 -3. Maximal cliques contained in graphs with density as 15% n \ M 2 3 4 5 6 400 5 9348 7465 322 1 500 4 14075 16563 854 9 600 0 17662 34032 2235 11 700 21566 59500 4783 46 800 0 25033 95314 8348 88 Table 7-4.... In PAGE 139: ... Maximal cliques contained in graphs with density as 10% n \ M 2 3 4 5 6 400 186 6604 943 7 0 500 154 11377 2364 30 0 600 86 18091 4479 40 1 700 46 26342 8838 123 0 800 45 36056 13118 215 2 Table 7-3. Maximal cliques contained in graphs with density as 15% n \ M 2 3 4 5 6 400 5 9348 7465 322 1 500 4 14075 16563 854 9 600 0 17662 34032 2235 11 700 21566 59500 4783 46 800 0 25033 95314 8348 88 Table7 -4. Maximal cliques contained in graphs with density as 20% n \ M 2 3 4 5 6 7 400 0 5538 25039 3692 67 0 500 0 5944 54132 10622 240 0 600 0 5677 100269 26182 678 2 700 0 5229 164267 50644 1400 4 800 0 4229 151391 101710 3513 15 From these tables we can see that the maximal cliques with middle size are the major part.... ..."

### Table 3: Maximal or-matchings for query graph G2 over the university database

1999

"... In PAGE 6: ... Thus, whenever x is bound in a weak match- ing, then it is bound to the chairman of the department. Table3 shows the set of maximal or-matchings for the query graph in Figure 3. For terminal nodes, we have listed the attached atoms instead of the identity of the object.... ..."

Cited by 19