Consider the following edge-weighted graph G with 9 vertices and 16 40 60 90 50 30 20 80 10 130 150 120 100 110 140 Q6.1 Kruskal List the weights of the MST edges in the order that Kruskal's algorithm adds them to the MST. Your answer should be a sequence of 8 integers, with one space between each integer 70

Consider the following edge-weighted graph G with 9 vertices and 16 40 60 90 50 30 20 80 10 130 150 120 100 110 140 Q6.1 Kruskal List the weights of the MST edges in the order that Kruskal's algorithm adds them to the MST. Your answer should be a sequence of 8 integers, with one space between each integer 70

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

Consider an undirected graph on 8 vertices, with 12 edges given as shown below: Q2.1 Give the result of running Kruskal's algorithm on this edge sequence (specify the order in which the edges are selected). Q2.2 For the same graph, exhibit a cut that certifies that the edge ry is in the minimum spanning tree. Your answer should be in the form E(S, V/S) for some vertex set S. Specifically, you should find S.
Let G = (X ∪ Y, E) be a bipartite graph such that the vertices are partitioned into two groups Xand Y , and each edge has one end point in X and one end point in Y .A 2-1 generalized matching is a set of edges S ⊂ E satisfying the following two conditions:1. Every vertex in X belongs to at most two edges in S.2. Every vertex in Y belongs to at most one edge in S.Give an algorithm to find the size (number of edges) of maximum 2-1 generalized matching
Let DIST (u, v) denote the distance between vertex u and v. It is well known that distances in graphs satisfy the triangle inequality. That is, for any three vertices u, v, w, DIST (u, v) ≤ DIST (u, w) + DIST (w, v). Let D∗ denote the distance between the two farthest nodes in G. Show that for any vertex s D∗ ≤ 2 max DIST (s, v).
Discrete mathematics. Let G = (V, E) be a simple graph4 with n = |V| vertices, and let A be its adjacency matrix of dimension n × n. We want to count the L-cycles : such a cycle, denoted by C = u0u1 · · · uL with uL = u0 contains L distinct vertices u0, . . . , uL-1 et L edges E(C) = {uiui+1 | 0 ≤ i ≤ L − 1} ⊆ E. Two cycles are distinct if the edge sets are different : C = C' if and only if E(C) = E(C'). We define the matrices D, T, Q, the powers of A by matrix multiplication : D = A · A = A2, T = A · D = A3, Q = A · T = A4. Consider the values on the diagonals. Prove that the number of 3-cycles N3 in the whole graph is N3 = 1/6 ∑ u∈V Tu,u
Discrete mathematics. Let G = (V, E) be a simple graph4 with n = |V| vertices, and let A be its adjacency matrix of dimension n × n. We want to count the L-cycles : such a cycle, denoted by C = u0u1 · · · uL with uL = u0 contains L distinct vertices u0, . . . , uL-1 et L edges E(C) = {uiui+1 | 0 ≤ i ≤ L − 1} ⊆ E. Two cycles are distinct if the edge sets are different : C = C' if and only if E(C) = E(C'). We define the matrices D, T, Q, the powers of A by matrix multiplication : D = A · A = A2, T = A · D = A3, Q = A · T = A4. Consider the values on the diagonals. Prove that for any vertex u ∈ V with degree d(u), d(u) = Du,u.
Let G be a connected graph with n vertices and m edges.Which of the following statements are true?(i) G is a tree if and only if n = m+1.(ii) G is a tree if and only if m = n+1.(iii) G is a tree if and only if the addition of any edgeto G will produce a unique cycle.(iv) G is a tree if and only if G contains at least onepath b etween any two vertices.(v) If G is connected, then G is a tree if and only if Gcontains at most one path between any two vertices.(vi) A connected subgraph of a tree is always a tree.
How many undirected graphs (not necessarily connected) can be constructed out of a given set V= {V 1, V 2,…V n} of n vertices ? Group of answer choices 2^(n(n-1)/2) 2^n n(n-l)/2 n! Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph? Adding a vertex in adjacency list representation is easier than adjacency matrix representation. In adjacency list representation, space is saved for sparse graphs. DFS and BSF can be done in O(V + E) time for adjacency list representation. These operations take O(V^2) time in adjacency matrix representation. Here is V and E are number of vertices and edges respectively. All of the above Given the starting vertex A, what is the visit order of the graph shown in Fig. 1 under the DFS traversal algorithm. ABDCFE ACBDFE ABCDFE ADBCEF Assume you have the adjacency matrix representing a graph. 1 represents a connection while -1 represents a lack of one:[-1, 1, - 1][-1, -1, 1][1, -1,…
Given a graph G, check whether can we color the vertices of a graph G using two colors such that no two adjacent vertices have the same color. Which algorithm will you apply for this problem and what would be the complexity?
Given an undirected, weighted graph G(V, E) with n vertices and m edges, design an (O(m + n)) algorithm to compute a graph G1 (V, E1 ) on the same set of vertices, where E1 subset of E and E1 contains the k edges with the smallest edge weights , where k < m.
Let G be a graph with n vertices. If the maximum size of an independent set in G is k, clearly explain why the minimum size of a vertex cover in G is n - k.
. Let G be a weighted, connected, undirected graph, and let V1 and V2 be a partition of the vertices of G into two disjoint nonempty sets. Furthermore, let e be an edge in the minimum spanning tree for G such that e has one endpoint in V1 and the other in V2. Give an example that shows that e is not necessarily the smallest- weight edge that has one endpoint in V1 and the other in V2.
Recall the Floyd-Warshall algorithm. For this problem, we are interested in the number of paths between each pair of vertices i and j in a directed acyclic graph. Suppose we know the number of paths between each pair of vertices where we restrict the intermediate vertices to be chosen from 1, 2, . . . , k − 1, show how we can extend the result to allow vertex k as an intermediate vertex as well. To conclude what would its complexity be?