Hello Doug， I see. Thanks for your reply. It seems to be known as a NP-C problem to compute the independent sets with minimum number of sets. It's equivalent to another problem/description that coloring a graph with a minimum number of colors. I've already found a graph coloring algorithm in the boost lib, it works quite well, both in efficiency and the fact it's quite close to the optimization result. Thanks. ------------------ Max 2007-11-14 ------------------------------------------------------------- 发件人：Douglas Gregor 发送日期：2007-11-14 10:23:09 收件人：boost-users@lists.boost.org 抄送： 主题：Re: [Boost-users] [BGL]MAXIMUM INDEPENDENT SET On Nov 11, 2007, at 5:11 PM, LoadCom wrote:
Hello,
I want to know if there's a "MAXIMUM INDEPENDENT SET" algorithm in the lib.
We do not have any algorithms that compute maximal independent sets; sorry! - Doug _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users