Discussion
For which constraint graphs does arc consistency decide satisfiability?
Answer: B
A tree structured problem can be made arc consistent in one sweep from the leaves and then solved without any backtracking at all, in time linear in the number of variables. That is why identifying or creating tree structure is so valuable. Complete graphs are the hardest case, domain uniformity is irrelevant and a single cycle already breaks the guarantee. A structural property that converts an exponential problem into a linear one is worth checking for before any search is attempted.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development