Abstract
Dechter [2] has proposed a cycle cutset method to solve Constraint Satisfaction Problems (CSPs). This method arbitrarily selects a set of nodes as cycle cutset and hence may contain some nodes which does not lie on any cycle. This will increase the size of the cutset and hence the time complexity of the method. In this paper, two minimal cycle cutset methods are presented. These methods first obtain a minimal cycle cutset in the constraint graph and then solve the CSP. Two algorithms to obtain a minimal cycle cutset in a graph are also presented here. The modified methods are tested on several randomly generated CSPs. On a class of constraint graph, the modified methods almost always show better performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
