Author Topic: QuickClique  (Read 2075 times)

0 Members and 1 Guest are viewing this topic.

Offline vlad777Topic starter

  • Frequent Contributor
  • **
  • Posts: 350
  • Country: 00
QuickClique
« on: July 25, 2016, 07:59:32 am »
Hello,

I have found out in this video that finding cliques is an unsolved problem.

Well I have made a program that finds them in polynomial time.
Maybe I didn't understand something , please someone set me strait.

Please try out my program, it is in the attachment.

You can read the QuickClique.cpp for explanation and source code.

Many thanks.

http://extraimago.com/images/2016/07/25/QuickClique.jpg

Edit:
   It has about O(m^4) complexity where m is the number of edges, and
   number of edges is n choose 2 so O( (n C 2)^4 ) complexity.
   (n is number of nodes)

« Last Edit: July 26, 2016, 03:53:38 pm by vlad777 »
Mind over matter. Pain over mind. Boss over pain.
-------------------------
 


Share me

Digg  Facebook  SlashDot  Delicious  Technorati  Twitter  Google  Yahoo
Smf