Q1a 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. 1b INDEPENDENT SET has the following Decision Problem: given a graph G and an integer k₁, does G have an independent set of size at least k₁? VERTEX COVER has the following Decision Problem: given a graph G and an integer k2, does G have a vertex cover of size at most k₂? It is known that INDEPENDENT SET is NP-complete. Prove that INDEPENDENT SET SP VERTEX COVER (i.e that independent set is polynomial-time reducible to vertex cover). Use this to conclude that VERTEX COVER must also be NP-complete.

Q1a 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. 1b INDEPENDENT SET has the following Decision Problem: given a graph G and an integer k₁, does G have an independent set of size at least k₁? VERTEX COVER has the following Decision Problem: given a graph G and an integer k2, does G have a vertex cover of size at most k₂? It is known that INDEPENDENT SET is NP-complete. Prove that INDEPENDENT SET SP VERTEX COVER (i.e that independent set is polynomial-time reducible to vertex cover). Use this to conclude that VERTEX COVER must also be NP-complete.

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

36. Let G be a simple graph on n vertices and has k components. Then the number m of edges of G satisfies n-k ≤m if G is a null graph. This statement is A. sometimes true B. always true C. never true D. Neither true nor false
3) The graph k-coloring problem is stated as follows: Given an undirected graph G= (V,E) with N vertices and M edges and an integer k. Assign to each vertex v in V a color c(v) such that 1
Be G = (V. E) a connected graph and u, vEV.The distance Come in u and v, denoted by du, v), is the length of the shortest path between u and v, Meanwhile he width from G, denoted as A(G) is the greatest distance between two of its vertices. Dice k EN such that k>0, consider the following decision problem: k-WIDTH: • I«WIDTH = {G| G is a graph} - L«WIDTH = {G | Gis a connected graph such that A(G) > k} Show that k-WIDTH EP. Hint:Study algorithms that find the shortest path between two vertices of a graph.
Given an undirected graph G = (V, E), a vertex cover is a subset of V so that every edge in E has at least one endpoint in the vertex cover. The problem of finding a minimum vertex cover is to find a vertex cover of the smallest possible size. Formulate this problem as an integer linear programming problem.
5. Fleury's algorithm is an optimisation solution for finding a Euler Circuit of Euler Path in a graph, if they exist. Describe how this algorithm will always find a path or circuit if it exists. Describe how you calculate if the graph is connected at each edge removal. Fleury's Algorithm: The algorithm starts at a vertex of v odd degree, or, if the graph has none, it starts with an arbitrarily chosen vertex. At each step it chooses the next edge in the path to be one whose deletion would not disconnect the graph, unless there is no such edge, in which case it picks the remaining edge (a bridge) left at the current vertex. It then moves to the other endpoint of that edge and adds the edge to the path or circuit. At the end of the algorithm there are no edges left ( or all your bridges are burnt). (NOTE: Please elaborate on the answer and explain. Please do not copy-paste the answer from the internet or from Chegg.)
Part 2: Random GraphsA tournament T is a complete graph whose edges are all oriented. Given a completegraph on n vertices Kn, we can generate a random tournament by orienting each edgewith probability 12 in each direction.Recall that a Hamiltonian path is a path that visits every vertex exactly once. AHamiltonian path in a directed graph is a path that follows the orientations of thedirected edges (arcs) and visits every vertex exactly once. Some directed graphs havemany Hamiltonian paths.In this part, we give a probabilistic proof of the following theorem:Theorem 1. There is a tournament on n vertices with at least n!2n−1 Hamiltonian paths.For the set up, we will consider a complete graph Kn on n vertices and randomlyorient the edges as described above. A permutation i1i2 ...in of 1,2,...,n representsthe path i1 −i2 −···−in in Kn. We can make the path oriented by flipping a coin andorienting each edge left or right: i1 ←i2 →i3 ←···→in.(a) How many permutations of the vertices…
ou are given a directed graph G = (V, E) and two vertices s and t. Moreover, each edge of this graph is colored either blue or red. Your goal is to find whether there is at least one path from s to t such that all red edges in this path appear after all blue edges (the path may not contain any blue edges or any red edges, but if it has both types of edges, all red edges should appear after all blue edges). Design and analyze an algorithm for solving this problem in O(n + m) time.
Given an undirected graph G = <V,E>, a vertex cover is a subset of vertices S  V such that for each edge (u,v) belongs to E, either u  S or v  S or both. The Vertex Cover Problem is to find minimum size of the set S. Consider the following algorithm to Vertex Cover Problem: (1) Initialize the result as {} (2) Consider a set of all edges in given graph. Let the set be E’. (3) Do following while E’ is not empty ...a) Pick an arbitrary edge (u,v) from set E’ and add u and v to result ...b) Remove all edges from E which are either incident on u or v. (4) Return result. It claim that this algorithm is exact for undirected connected graphs. Is this claim True or False? Justify the answer.
The minimum vertex cover problem is stated as follows: Given an undirected graph G = (V, E) with N vertices and M edges. Find a minimal size subset of vertices X from V such that every edge (u, v) in E is incident on at least one vertex in X. In other words you want to find a minimal subset of vertices that together touch all the edges. For example, the set of vertices X = {a,c} constitutes a minimum vertex cover for the following graph: a---b---c---g d e Formulate the minimum vertex cover problem as a Genetic Algorithm or another form of evolutionary optimization. You may use binary representation, OR any repre- sentation that you think is more appropriate. you should specify: • A fitness function. Give 3 examples of individuals and their fitness values if you are solving the above example. • A set of mutation and/or crossover and/or repair operators. Intelligent operators that are suitable for this particular domain will earn more credit. • A termination criterion for the…
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 node
In Computer Science a Graph is represented using an adjacency matrix. Ismatrix is a square matrix whose dimension is the total number of vertices.The following example shows the graphical representation of a graph with 5 vertices, its matrixof adjacency, degree of entry and exit of each vertex, that is, the total number ofarrows that enter or leave each vertex (verify in the image) and the loops of the graph, that issay the vertices that connect with themselvesTo program it, use Object Oriented Programming concepts (Classes, objects, attributes, methods), it can be in Java or in Python.-Declare a constant V with value 5-Declare a variable called Graph that is a VxV matrix of integers-Define a MENU procedure with the following textGRAPHS1. Create Graph2.Show Graph3. Adjacency between pairs4.Input degree5.Output degree6.Loops0.exit-Validate MENU so that it receives only valid options (from 0 to 6), otherwise send an error message and repeat the reading-Make the MENU call in the main…
Consider eight points on the Cartesian two-dimensional x-y plane. a g C For each pair of vertices u and v, the weight of edge uv is the Euclidean (Pythagorean) distance between those two points. For example, dist(a, h) : V4? + 1? = /17 and dist(a, b) = v2? + 0² = 2. Because many pairs of points have identical distances (e.g. dist(h, c) V5), the above diagram has more than one minimum-weight spanning tree. dist(h, b) = dist(h, f) Determine the total number of minimum-weight spanning trees that exist in the above diagram. Clearly justify your answer.