Discussion
How is a tree structured constraint problem solved efficiently?
Answer: C
Choosing a root, ordering the variables so that every parent precedes its children, making each arc from parent to child consistent in reverse order and then assigning forward gives a solution with no backtracking. The work is linear in the variables and quadratic in the domain size. Enumeration, repeated propagation and graph completion are unnecessary or harmful. An algorithm exploiting a structural property directly is far better than a general one applied to a structured instance.
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