Discussion
What is a constraint graph?
Answer: C
Drawing a node for each variable and an edge for each binary constraint exposes the structure of the problem, and that structure determines which algorithms will be efficient. A tree shaped graph is solvable in linear time, and a nearly tree shaped one is nearly as easy. Search trees, statistics and domain contents are different objects. Making the structure of a problem visible so that it can be exploited is the practical reason for drawing the graph at all.
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