GraphStream Users

Archives de la liste Aide


Re: Maximal Clique


Chronologique Discussions 
  • From: Stefan Balev <stefan.balev AT gmail.com>
  • To: graphstream-users AT litislab.fr
  • Cc: frederic.guinand AT gmail.com
  • Subject: Re: Maximal Clique
  • Date: Sun, 19 Jun 2011 22:56:57 +0200
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :cc:content-type:content-transfer-encoding; b=u4FhIwAqyjMX7HjYI+M7RlR23d4fG+zvfh4W5b1FbpqY+48gwkGAi1wm+opyqql1D2 ZwNHvDD2qeeTNaOp4C0zkJ2zZJX8RZmzElS1/stJT+5nZJgOm51wvTfBqF2saJgvWpxh YLRCwt4OgveMirMmchGuQLyrXO0nx2fTesyLY=

Hi Rodrigo,

If you can wait, just use a brute force approach. Is your graph
weighted or you just want to find a maximum cardinality clique ?

Cheers,

--
Stefan


2011/6/19 Rodrigo Lins
<lins.oliveira AT gmail.com>:
> Thanks Frederic for your answer.
> But I really need to find de cliques in a graph, and I know this algorithm
> is a NP-Hard problem.
> I realy need to find the maximum cliques in a graph. I can wait.
> Thanks,
> Rodrigo.
>
> 2011/6/19 Frédéric Guinand
> <frederic.guinand AT gmail.com>
>>
>> Hello Rodrigo,
>>
>> The problem of finding the maximum clique in a graph is an NP-Hard
>> problem. In other words, it is not possible to do so in a reasonable time
>> (polynomial in the size of the graph). So, any method for finding a maximum
>> clique is equivalent to use a brute force approach.
>>
>> If you want to know more:
>>
>> http://en.wikipedia.org/wiki/NP-complete
>> http://en.wikipedia.org/wiki/Clique_problem
>>
>> What was the original problem you try to deal with?
>>
>>     Bye,
>>
>>         Frederic
>>
>>
>> Rodrigo Lins wrote:
>>>
>>> Anyone knows if it is possible to find a maximal clique in a graph using
>>> GraphStream?
>>> If it is possible what class do it?
>>>
>>> Thanks a lot!
>>> Rodrigo.
>
>



Archives gérées par MHonArc 2.6.16.

Top of page