0.25
0.5
0.75
1.25
1.5
1.75
2
Redundancy-Aware Maximal Cliques
Published on Sep 27, 20133809 Views
Recent research efforts have made notable progress in improving the performance of (exhaustive) maximal clique enumeration (MCE). However, existing algorithms still suffer from exploring the huge sear
Related categories
Chapter list
Redundancy-Aware Maximal Cliques00:00
Maximal Cliques00:13
Classic problem00:57
Classic algorithm - 101:28
Classic algorithm - 202:11
Problems of MCE - 102:53
Problems of MCE - 204:41
Notations05:32
A new notion06:19
A naïve implementation08:43
Main idea09:36
For efficiency - first step - 110:37
For efficiency - first step - 211:09
For efficiency - first step - 312:23
For efficiency - a further step - 112:55
For efficiency - a further step - 214:25
Applying the summary - 115:12
Applying the summary - 216:28
On real world networks - 117:13
On real world networks - 217:35
On real world networks - 318:20
On real world networks - 418:44
Wrapping up19:30