Best ROBDD variable ordering for functions with disjunctive decompositions

The problem of finding a variable ordering to minimise the size of a reduced ordered binary decision diagrams (ROBDD) is considered for functions possessing disjunctive decompositions. An example is presented showing that the best ordering for a function with a disjunctive decomposition cannot always be directly determined from the best orderings for the component functions