Skip to Main Content
An efficient implementation of a consistent labeling technique can lead to a fast solution in solving all kinds of tree search problems by reducing the search space from a potentially exponential size to a much smaller size. In this paper a scalable parallel algorithm is presented in achieving labeling consistency. This algorithm is optimal in execution time as well as in processor-time product. It is suitable for implementation on most distributed memory multiprocessor system.