The authors develop two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, they give a parallel algorithm for the EREW PRAM model and a distributed algorithm for net...
详细信息
Sublinear parallel graph matching algorithms are investigated. The author proposes an approximation scheme for the cardinality matching problem on general graphs that runs in O(k5/logsup 4/n) parallel time using O(2k/...
详细信息
暂无评论