Пожалуйста, прочтите новое правило об ограничении использования AI-инструментов. ×

finding all the cliques in a graph

Правка en3, от surajkvm007, 2016-03-13 17:06:36

can anyone please provide me with a hint to solve this problem

basically we need to find all the cliques in the graph but in short time.

Update : I tried Bron-Kerbosch algorithm but it takes exponential time and the time limit for the problem is 1 sec with maximum of 128 vertices.

Теги graph, clique

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский surajkvm007 2016-03-13 17:06:36 148
en2 Английский surajkvm007 2016-03-13 15:03:17 79
en1 Английский surajkvm007 2016-03-13 15:02:00 142 Initial revision (published)