Dagh

Hi,

I like the new equation, how about a termination condition for the recursion?

Best regards.

Amr Fahmy

---

Hi Amr. I am not completely sure what you mean, but I believe the recursion terminates because the sum, which contains the recursion, is over the children of the node. So for a leave k, $A(S,k)=|S|$. Was that what you meant?

$A(S,i)=|S|+\sum _{j\in C(i)}\left((\max _{S'\subset X_{j} \atop {S\cap X_{j}=S'\cap X_{i} \atop S\cup S'{\text{independent set}}}}A(S',j))-|S\cap X_{j}|\right)$

Regards,

Dag

Start a discussion with Dagh

Talk pages are where people discuss how to make content on Wikipedia the best that it can be. Start a new discussion to connect and collaborate with Dagh. What you say here will be public for others to see.

Start a discussion