Is it possible to find the maximum clique in general graphs?

Details Is it possible to find the maximum clique in general graphs? Is it possible to find the maximum clique in general graphs?

2011-10-24

arxiv.org/abs/1110.5355v3

Computer Science

Data Structures and Algorithms

http://hal.archives-ouvertes.fr/hal-00625917/en

Scientific paper

Finding the maximum clique is a known NP-Complete problem and it is also hard
to approximate. This work proposes two efficient algorithms to obtain it.
Nevertheless, the first one is able to fins the maximum for some special cases,
while the second one has its execution time bounded by the number of cliques
that each vertex belongs to.

Affiliated with

Also associated with

No associations

Rating

Is it possible to find the maximum clique in general graphs? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Is it possible to find the maximum clique in general graphs?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Is it possible to find the maximum clique in general graphs? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-93688