Artificial Intelligence: A Modern Approach
3rd Edition
ISBN: 9780136042594
Author: Stuart Russell, Peter Norvig
Publisher: Prentice Hall
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 6, Problem 8E
Explanation of Solution
3-coloring of graph:
a. A1 = R.
b. H = R conflicts with A1.
c. H = G.
d. A4 = R.
e. F1 = R.
f. A2 = R conflicts with A1, A2 = G conflicts with H, so A2 = B.
g. F2 = R.
h. A3 = R conflicts with A4, A3 = G conflicts with H, A3 = B conflicts with A2, so backtrack. Conflict set is {A2,H,A4}, so jump to A2. Add {H,A4} to A2’s conflict set.
i. A2 has no more values, so backtrack...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
TRY YOUR BEST PLEASE
Let A and B each be sets of N labeled vertices, and consider bipartite graphs between A and B.
1. Starting with no edges between A and B, if |E| many edges are added between A and B uniformly at random, what is the expected number of perfect matchings in the resulting graph? Hint: if S is a set of edges in a potential perfect matching, let X sub S = 1 if all the edges in S are added to the graph, and X sub S= 0 if any of them are missing. What isE[X sub S]?
Consider this graph with 11 vertices and 20 edges.
Our goal is to colour each of the 11 vertices with one of three colours (Apricot, Brown, Cyan) so that no edge joins
two vertices of the same colour. For example, if the vertex 6 is coloured Brown, then the four vertices adjacent to this
vertex (10, 5, 2, 7) cannot be coloured Brown, since that would create a Brown-Brown edge.
If we can assign a colour to each vertex so that no edge joins two vertices of the same colour, then we say that this
graph is 3-Colourable.
If this task is impossible (i.e., no matter what, we must create at least one edge joining two vertices of the same
colour), then we say that this graph is not 3-Colourable.
Determine whether this graph is 3-Colourable. Answer either YES or NO.
It was claimed that anyone involved in the Hollywood film industry can be linked through their film roles to Kevin Bacon within six steps. You are suspicious of such a claim and decide to verify it using the given dataset.Before you start to verify the claim, you first notice that it is not possible for this claim to be true if the actor graph is not even connected. Briefly explain how you can verify a given undirected graph is connected (i.e there exists a path between any two actors in the graph). Include the runtime of your algorithm as well.
Chapter 6 Solutions
Artificial Intelligence: A Modern Approach
Knowledge Booster
Similar questions
- Given a graph that is a tree (connected and acyclic). (I) Pick any vertex v.(II) Compute the shortest path from v to every other vertex. Let w be the vertex with the largest shortest path distance.(III) Compute the shortest path from w to every other vertex. Let x be the vertex with the largest shortest path distance. Consider the path p from w to x. Which of the following are truea. p is the longest path in the graphb. p is the shortest path in the graphc. p can be calculated in time linear in the number of edges/verticesarrow_forwardGiven a graph that is a tree (connected and acyclic). (1) Pick any vertex v. (II) Compute the shortest path from v to every other vertex. Let w be the vertex with the largest shortest path distance. (III) Compute the shortest path from w to every other vertex. Let x be the vertex with the largest shortest path distance. Consider the path p from w to x. Which of the following are true a. p is the longest path in the graph b. p is the shortest path in the graph c. p can be calculated in time linear in the number of edges/vertices a,c a,b a,b,c b.carrow_forwardSuppose that G is an unconnected graph that consists of 4 connected components. The first component is K4, the second is K2,2, the third is C4 and the fourth is a single vertex. Your job is to show how to add edges to G so that the graph has an Euler tour. Justify that your solution is the minimum number of edges added.arrow_forward
- 2. Let G = (V, E) be a directed weighted graph with the vertices V = {A, B, C, D, E, F) and the edges E= {(A, B, 12), (A, D, 17), (B, C, 8), (B, D, 13), (B, E, 15), (B, F, 13), (C, E, 12), (C, F, 25)}, where the third components is the cost. (a) Write down the adjacency list representation the graph G = (V, E).arrow_forwardthink about a search problem on a graph G = (N, E, C), where N represents nodes, E represents edges between nodes, and the weight of an edge e ∈ E is denoted by C(e), where C(e) > 1 for all e ∈ E. We have a heuristic h that calculates the smallest number of edges from a starting state to a goal state. Now, imagine removing edges from the graph while leaving the heuristic values the same. The question is whether the heuristic remains admissible and consistent after this change. and prove themarrow_forwardEvery pair of vertices in a graph that is linked by two different paths is said to be biconnected. An articulation point in a connected graph is a vertex that, if it and its surrounding edges were eliminated, would cause the graph to become disconnected. demonstrate the biconnection of any graph lacking articulation points. Tip: To create two disjoint paths connecting s and t given a set of vertices s and t and a path connecting them, take advantage of the fact that none of the vertices on the path are articulation points.arrow_forward
- A weighted graph consists of 5 nodes and the connections are described by: i. ii. iii. iv. Node 1 is connected with nodes 2 and 3 using weights 2 and 6 respectively.Node 2 is connected with nodes 3, 4 and 5 using weights 7, 3 and 4 respectively.Node 3 is connected with nodes 4 and 5 using weights -2 and 2 respectively.Node 4 is connected with node 5 using weight -1. Solve the problem for finding the minimum path to reach each nodes from the first nodearrow_forwardConsider a graph where vertices represent intersections and edges represent roads. The company Food To Go can place a maximum of one food cart at each intersection. A food cart placed at intersection X has an income equal to the number of roads at intersection X (ie, the degree of vertex X). If two food carts share a road, the income of that road is shared equally among the two. We are interested in calculating the total profit of all food carts placed, ie, the total income minus the cost, where each food cart costs 1 unit and each road provides an income of 1 unit. More formally, the profit for a graph G = (V, E) where the set SC V represents food cart locations, is calculated by the number of edges covered by the vertices in S minus the size of S (ie. |S). A D C E B In this example, placing a food cart on each of the vertices A and C will result in a profit of ISCA P (A D(CD) (CFU VACU-5arrow_forwardGive a Boolean formula that is satisfiable exactly when the graph below can be colored with three colors so that no two connected nodes have the same color. Use the variables ai, bi, ci (i ∈ {1,2,3,4,5}) to represent a nodes' color. The variable ai holds when the node i has color "a". bi or ci for colors b and c. Each node must have exactly one color.arrow_forward
- Consider a graph with five nodes labeled A, B, C, D, and E. Let's say we have the following edges with their weights: A to B with weight 3 A to C with weight 1 B to C with weight 2 B to D with weight 1 C to E with weight 4 D to E with weight 2 a. Find the shortest path from A to E using Dijkstra's algorithm. (Draw the finished shortest path) b. Use Prim to find the MST (Draw the finished MST) c. Use Kruskal to find the MST (Draw the finished MST) d. What's the difference between Prim and Kruskal algorithms? Do they always have the same result? Why or why not.arrow_forwardPlease help with this question:arrow_forwardConsider the following graph. We are finding the lengths of the shortest paths from vertex a to all vertices by the Relaxation algorithm from the lecture: At the beginning, every vertex v is set as unmarked and h(v) = +∞. Then a is set as open and h(a) = 0. How many ways there are to select five (at that moment) open vertices so that after their relaxation (and closing) the value of h(v) will represent the shortest path length from a to every v in the graph? Specify the number of ways and one such way separated by commas and spaces, for example 25, b, а, с, а, d. d 3 1 a 1 -4 -4arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education