In particular , given an ordering of the variables , every variable is associated a bucket containing all constraints such that the variable is the greatest in their scope .
Bucket elimination can be reformulated as an algorithm working on a particular tree decomposition .
Given an ordering of the variables , every variable is associated a bucket containing all constraints such that the variable is the greatest in their scope .
Bucket elimination can be reformulated as an algorithm working on a particular tree decomposition .