From: Discovering the maximum k-clique on social networks using bat optimization algorithm
No | Graph Name | # of Nodes | # of Edged | Largest k | *Obtained k |
---|---|---|---|---|---|
1 | c-fat200-1 | 200 | 1534 | 12 | 12 |
2 | c-fat200-2 | 200 | 3235 | 24 | 24 |
3 | c-fat200-5 | 200 | 8473 | 58 | 58 |
4 | c-fat500-1 | 500 | 4453 | 14 | 14 |
5 | c-fat500-2 | 500 | 9139 | 26 | 26 |
6 | c-fat500-5 | 500 | 23,191 | 64 | 64 |
7 | Johnson8-4–4 | 70 | 1200 | 14 | 14 |
8 | Johnson16-2–4 | 120 | 5460 | 8 | 8 |
9 | Johnson32-2–4 | 496 | 107,880 | 16 | 16 |
10 | Keller4 | 171 | 9435 | 11 | 11 |
11 | Keller5 | 776 | 225,990 | 27 | 27 |
12 | hamming6-2 | 64 | 1824 | 32 | 32 |
13 | hamming8-2 | 256 | 31,616 | 128 | 128 |
14 | hamming10-2 | 1024 | 518,646 | 512 | 512 |
15 | Sanr200-0.7–1 | 200 | 13,868 | 18 | 17 |
16 | Sanr400-0.5 | 400 | 39,984 | 13 | 13 |
17 | Sanr1000 | 1000 | 250,500 | 15 | 14 |