Finding max clique in perfect graphs

A fast algorithm to find the size of the largest clique in a perfect graph(this one having odd cycles with at least 1 chord) with about 100 vertices ??

And is there any simpler method than brute force as this is a perfect graph and there should be a polynomial time solution to it. But I am not able to find the algorithm.

Does greedy coloring give optimal 开发者_如何学JAVAcoloring in all perfect graphs??

100 vertices? Pffft. Brute force it in a few seconds (perhaps fraction of a second) with Cliquer. http://users.tkk.fi/pat/cliquer.html

See page 296, with some work you should write the right linear programming constraint to solve this problem.

http://www.scribd.com/doc/5710463/Geometric-Algorithms-And-Combinatorial-Optimization