Known solutions of a large number of important (and difficult) computational problems called NP-complete problems depend on enumeration techniques which examine all feasible alternatives. This paper considers the design of enumeration schemes in a distributed environment in an attempt to exploit the parallel activities inherent in enumeration algorithms.
No takes yet. Share an insight, caveat, or question.
El-Dessouki et al. (1980) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: