Our approach is similar to Kibble and Power (2004) in that we don't use the concept of centering transitions.
our method is more efficient in that Kibble and Power (2004) use centering transitions to rank the set of generated solutions (some of which are incoherent), whereas we encode centering constraints in elementary trees to reduce the search space of possible solutions before we start computing them.