Parallel path-consistency algorithms for constraint satisfaction
Somnuk Keretho, Rasiah Loganantharaj, Venkat Naidu Gudivada · 2002
The authors previously proposed (1991) a O(n/sup 3/) path-consistency algorithm which requires O(n/sup 2/) space, whereas other known O(n/sup 3/) time complexity algorithms need O(n/sup 3/) space. They use this algorithm as the main framework for a parallel version.>