Input: a directed grid graph G, a set of target points S, and an integer k...
Input: a directed grid graph G, a set of target points
S, and an integer k
Output: true if there is a path through G that visits all points in
S using at most k left turns
A grid graph is a graph where the vertices are at integer
coordinates from 0,0 to n,n. (So 0,0, 0,1, 0,2,
...0,n, 1,0, etc.) Also, all edges are between vertices
at distance 1. (So 00->01, 00->10, but not 00 to any other
vertex. Also some edges could be missing.)
Either give a polynomial time algorithm to solve this problem, or
prove this problem is NP-hard.
Homework Answers
Add Answer to:
Input: a directed grid graph G, a set of target points
S, and an integer k...
2. Consider the following problem: Input: graph G, integer k Question: is it possible to partition...
2. Consider the following problem: Input: graph G, integer k Question: is it possible to partition vertices of G into k disjoint independent sets? Is this problem polynomial or NP-complete? Explain your answer
X) (4 points) If k is a positive integer, a k-coloring of a graph G is an assignment of one of k ...
COMP Discrete Structures: Please answer completely and
clearly.
(3).
(5).
x) (4 points) If k is a positive integer, a k-coloring of a graph G is an assignment of one of k possible colors to each of the vertices/edges of G so that adjacent vertices/edges have different colors. Draw pictures of each of the following (a) A 4-coloring of the edges of the Petersen graph. (b) A 3-coloring of the vertices of the Petersen graph. (e) A 2-coloring (d) A...
Let G = (V;E) be an undirected and unweighted graph. Let S be a subset of the vertices. The graph...
Let G = (V;E) be an undirected and unweighted graph. Let S be a subset of the vertices. The graph induced on S, denoted G[S] is a graph that has vertex set S and an edge between two vertices u, v that is an element of S provided that {u,v} is an edge of G. A subset K of V is called a killer set of G if the deletion of K kills all the edges of G, that is...
(a) Given a graph G = (V, E) and a number k (1 ≤ k ≤...
(a) Given a graph G = (V, E) and a number k (1 ≤ k ≤ n), the CLIQUE problem asks us whether there is a set of k vertices in G that are all connected to one another. That is, each vertex in the ”clique” is connected to the other k − 1 vertices in the clique; this set of vertices is referred to as a ”k-clique.” Show that this problem is in class NP (verifiable in polynomial time)...
3, (30 points) Given a directed graph G - N. E), each edge eEhas weight We, 3, (30 points) Given a directed graph...
3, (30 points) Given a directed graph G - N. E), each edge eEhas weight We, 3, (30 points) Given a directed graph G (V, E), each edgee which can be positive or negative. The zero weight cycle problem is that whether exists a simple cycle (each vertex passes at most once) to make the sum of the weights of each edge in G is exactly equal to 0. Prove that the problem is NP complete.
3, (30 points) Given...
For a directed graph the in-degree of a vertex is the number of edges it has...
For a directed graph the in-degree of a vertex is the number of edges it has coming in to it, and the out- degree is the number of edges it has coming out. (a) Let G[i,j] be the adjacency matrix representation of a directed graph, write pseudocode (in the same detail as the text book) to compute the in-degree and out-degree of every vertex in the Page 1 of 2 CSC 375 Homework 3 Spring 2020 directed graph. Store results...
The input to SPANNINGTREEWITHKLEAVES is a graph G and an integer K. The question asked by...
The input to SPANNINGTREEWITHKLEAVES is a graph G and an integer K. The question asked by SPAN NINGTREEWITHKLEAVES is whether G has a spanning tree with exactly K leaves. Problem 3. Show that SPANNINGTREEWITIIKLEAVES is NP-complete. Hint: There is a simple polynomial time reduction from HAMILTONIANPATH to SPANNINGTREEWITHKLEAVES.
Let G = (V, E) be a directed acyclic graph with n vertices and m edges....
Let G = (V, E) be a directed acyclic graph with n vertices and m edges. Give an O(n + m) time algorithm that determines if G contains a directed path that touches every vertex in G exactly once. The graph G is given by its adjacency list representation.
Let G be a directed graph on n vertices and maximum possible directed edges; assume that...
Let G be a directed graph on n vertices and maximum possible directed edges; assume that n ≥ 2. (a) How many directed edges are in G? Present such a digraph when n = 3 assuming vertices are 1, 2, and 3. You do not have to present a diagram, if you do not want to; you can simply present the directed edges as a set of ordered pairs. b) Is G, as specified in the problem, reflexive? Justify briefly....
Let G (V, E) be a directed graph with n vertices and m edges. It is known that in dfsTrace of G t...
Let G (V, E) be a directed graph with n vertices and m edges. It is known that in dfsTrace of G the function dfs is called n times, once for each vertex It is also seen that dfs contains a loop whose body gets executed while visiting v once for each vertex w adjacent to v; that is the body gets executed once for each edge (v, w). In the worst case there are n adjacent vertices. What do...
2. Consider the following problem: Input: graph G, integer k Question: is it possible to partition vertices of G into k disjoint independent sets? Is this problem polynomial or NP-complete? Explain your answer
COMP Discrete Structures: Please answer completely and
clearly.
(3).
(5).
x) (4 points) If k is a positive integer, a k-coloring of a graph G is an assignment of one of k possible colors to each of the vertices/edges of G so that adjacent vertices/edges have different colors. Draw pictures of each of the following (a) A 4-coloring of the edges of the Petersen graph. (b) A 3-coloring of the vertices of the Petersen graph. (e) A 2-coloring (d) A...
3, (30 points) Given a directed graph G - N. E), each edge eEhas weight We, 3, (30 points) Given a directed graph G (V, E), each edgee which can be positive or negative. The zero weight cycle problem is that whether exists a simple cycle (each vertex passes at most once) to make the sum of the weights of each edge in G is exactly equal to 0. Prove that the problem is NP complete.
3, (30 points) Given...
For a directed graph the in-degree of a vertex is the number of edges it has coming in to it, and the out- degree is the number of edges it has coming out. (a) Let G[i,j] be the adjacency matrix representation of a directed graph, write pseudocode (in the same detail as the text book) to compute the in-degree and out-degree of every vertex in the Page 1 of 2 CSC 375 Homework 3 Spring 2020 directed graph. Store results...
The input to SPANNINGTREEWITHKLEAVES is a graph G and an integer K. The question asked by SPAN NINGTREEWITHKLEAVES is whether G has a spanning tree with exactly K leaves. Problem 3. Show that SPANNINGTREEWITIIKLEAVES is NP-complete. Hint: There is a simple polynomial time reduction from HAMILTONIANPATH to SPANNINGTREEWITHKLEAVES.
Let G (V, E) be a directed graph with n vertices and m edges. It is known that in dfsTrace of G the function dfs is called n times, once for each vertex It is also seen that dfs contains a loop whose body gets executed while visiting v once for each vertex w adjacent to v; that is the body gets executed once for each edge (v, w). In the worst case there are n adjacent vertices. What do...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago