GraphStream Users

Archives de la liste Aide


Re: Maximal Clique


Chronologique Discussions 
  • From: "Frédéric Guinand" <frederic.guinand AT gmail.com>
  • To: graphstream-users AT litislab.fr
  • Subject: Re: Maximal Clique
  • Date: Sun, 19 Jun 2011 21:22:27 +0200
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:reply-to:user-agent:mime-version:to:subject :references:in-reply-to:content-type:content-transfer-encoding; b=FMGuWPcSgL3aWQuwjIf5qcKdZLuIDqhKSgyrrDPjbaaxUWSWXYQbyssxl6uAMLZ7c8 URZ62ek9JdQgS/BUfoksW/Q5NjvTCHt6YfMX9Mhe5xXHmteu/m2PNezmEiWM3IoveY2D wKRRpfLDGhGQwfGWCAk9LUEWYqCqnqIouRMYw=


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