3. Let G be the following graph. V7 V1 V2 V8 V5 V6 V3 VA (a) Using the greedy algorithm, proper vertex-color G with the order V₁, V2, V3, V4, V5, V6, U7, Vs. How many colors did you use? (b) Find x(G) and show a coloring that demonstrates this. (c) Provide an ordering of the vertices that when input into the greedy algorithm, produces a proper vertex-coloring that uses x(G) many colors.

3. Let G be the following graph. V7 V1 V2 V8 V5 V6 V3 VA (a) Using the greedy algorithm, proper vertex-color G with the order V₁, V2, V3, V4, V5, V6, U7, Vs. How many colors did you use? (b) Find x(G) and show a coloring that demonstrates this. (c) Provide an ordering of the vertices that when input into the greedy algorithm, produces a proper vertex-coloring that uses x(G) many colors.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

For the graph below determine the minimum number of colors necessary to colorits vertices. Justify your answer, by (i) giving a coloring and (ii) explaining why it is not possibleto use fewer colors. You can represent colors by letters a, b, c, .... To show the coloring, mark eachvertex with its color.
How many entries would the adjacency list representation for the following graph contain? (Assume that the array slots for each vertex count as one entry, and the linked list nodes for edges each count as one entry as well.) D B E A F G
5. * Show that there is an algorithm to decide if a graph has a vertex cover of size k, with running time O(kn +20(k)). Hint: use the FPT algorithm discussed in class and the results of the previous problem.
Note: Solve the following question and please don't repost previous answers and don't give a computer generated answer. Problem: Draw a simple, connected, directed, weighted graph with 9 vertices and 17 edges, each with unique edge weights. Identify one vertex as a “start” vertex and illustrate a running of Dijkstra’s algorithm on this graph.
We have the following directed graph G, where the number on each edge is the cost of the edge. 1. Step through Dijkstra’s Algorithm on the graph starting from vertex s, and complete the table below to show what the arrays d and p are at each step of the algorithm. For any vertex x, d[x] stores the current shortest distance from s to x, and p[x] stores the current parent vertex of x. 2. After you complete the table, provide the returned shortest path from s to t and the cost of the path.
The following table(picture) presents the implementation of the Dijkstra algorithm on the evaluated graph G with 8 vertices. How many different shortest paths exist in the graph G between the vertices a and g?
7. Consider the following graph: A 14 CO D 9 E C 12 10 17 b) What is the weight of the minimum spanning tree? B Apply Kruskal's algorithm to find the minimum spanning tree. Edges are sorted first by length, and in the event of a tie, by name, where the two letters are in alphabetical order. Use makeset (x), find (x), and union (x, y) to determine if there are cycles. a) Circle the edges that are part of the minimum spanning tree. AC, AD, AE, BC, BD, BE, DE c) Draw the tree that results from applying the union-find algorithm for cycle detection. When drawing the tree, put vertices with lower letters in the left subtrees so that all the vertices in a level are sorted alphabetically from left to right
Find back-edges for the following graphs starting from smallest nodes, and then find articulation vertices. (A (H) (E) (F B D A E F Please show your work step by step.
Run the Bellman-Ford Algorithm on the graph below to find the shortest path distances from the vertex S to all other vertices. Make sure that you give the initialization and show all the steps of the algorithm. 10 A 1 2 1 1 -2 -7 3. -1 8. F.
A B. D H Suppose you run the topological sort algorithm on the graph above starting at vertex C. Use the rule that when there is a choice of vertices for the algorithm to visit, it visits them in alphabetic order. Which vertex would end up first in the eventual topologically sorted order? Which would end up being second? Which would end up being third? Which would end up being fourth? Which would end up being fifth? Which would end up being sixth?
Kruskal's minimum spanning tree algorithm is executed on the following graph. Select all edges from edgeList that belong to the minimum spanning tree. edgeList result List AD BC BE CF EF DG EG EH GH D 7 9 G 1 B 5 3 A E H 4 2 6 8 F
Build a weighted graph that models a section of your home state. Use Dijkstra’s algorithm to determine the shortest path from a starting vertex to the last vertex.