Re: Maximal Clique

[julien schleich <julien.schleich AT uni.lu>]

I will be more clear:
It is highly probable that you will never see the result of your algorithm, 
even if you live very long. This is just too much computation. I would go for 
heuristics, i.e. algorithms finding good approximated solution in an 
acceptable time.
Nevertheless there may be hope: it really depends on your number of edges. If 
the graph is VERY sparse, it may be possible. Yet, I regret I do not have 
time for such a project.

Best regards,
Julien

On Jun 20, 2011, at 4:17 PM, Rodrigo Lins wrote:

> Hi Julien,
> You can do this algorithm?
> In my project, i use all active stock (140 stocks) in BOVESPA (a stock 
> exchange from Brazil).
> And i use an algorithm to find the Pearson Product Momentum between all 
> stocks. Every stock represent an node in my graph and If the PPM > than a 
> empirical value, i put a vertice between this nodes. Then i need to find 
> the maximum cliques and plot this graph.
> I'm already calculating the PPM. Now, i need to calculate the maximal 
> clique and plot a graph.
> 
> Thanks for all,
> Rodrigo.