Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

The Best Independent Set problem is defined as follows: Input: An undirected graph G, in which each vertex is marked by a positive value ;

image text in transcribed

image text in transcribed

The "Best Independent Set" problem is defined as follows: Input: An undirected graph G, in which each vertex is marked by a positive value ; and a target value T. Goal: A set of vertices S such that (a) no two vertices in S are connected by an edge in G; and (b) the total value of the vertices in S is at least T. For instance, in Graph 1 below, with T=16, there are three solutions: { C,D },{ A,E}, and {B,E} In Graph 2, with T=21 the only solution is {G,H,K} The N-Queens problem is actually a special case of this, with the vertices being the squares on the chess board, an edge between two vertices if the squares attack, all vertices have value 1 , and the target value is N. A. Describe an instance of Best Independent Set where doing a breadth-first search will construct 1000 (or more) times as many states as doing a depth-first search. B. Describe an instance of Best Independent Set where doing a depth-first search will construct 1000 (or more) times as many states as doing a breadth-first search. (Hint: There is an instance where the correct solution contains only one vertex.)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

More Books

Students also viewed these Databases questions