User talk:Dagh

From Wikipedia, the free encyclopedia

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