Topological pattern discovery - maximal cliques

• Maximal common sub-graph

  • Using maximal clique detection in edge product graphs, (Bron-Kerbosch algorithm)

• only practical for pairwise comparisons

Previous slide

Next slide

Back to first slide

View graphic version