Re: [boost] BGL: max clique?

From: David Abrahams (abrahams_at_[hidden])
Date: 2001-03-04 14:30:39

----- Original Message -----
From: "Phlip" <pplumlee_at_[hidden]>

> The good news is our algorithmicist at work is about to blow your max
clique
> algorithm out of the water. But the other good news is it's proprietary,
so
> you'l have to either jump ship or wait 20 years to see how we did it. :-)

A previous poster has implied that this problem is proven NP-complete. That
means that if your algorithmicist has a polynomial solution, (s)he is about
to revolutionize computation. I guess in your shoes I would be preparing
myself to realize I had overlooked something ;-)

-Dave