Finding max clique in perfect graphs

Posted by copperhead on Stack Overflow See other posts from Stack Overflow or by copperhead
Published on 2010-06-11T05:05:17Z Indexed on 2010/06/11 5:12 UTC
Read the original article Hit count: 270

Filed under:
|
|
|

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 ??

© Stack Overflow or respective owner

Related posts about c++

Related posts about algorithm