An oscillating algorithm for variable ordering in binary decision diagram

In this paper we present a novel heuristic for improving the variable order computation in the binary decision diagram. The proposed algorithm uses two way swapping and it oscillates forward and backward to minimize the number of cycles needed to get the best order. The validity of the proposed approach has been shown using ISCAS 85 benchmarks.