4. The subgraph-isomorphism problem takes two graphs Gl and G2 and asks whetherGl is isomorphic to a subgraph of G2. Show thata) the subgraph-isomorphism problem is in NP; andb) it is NP-complete by giving a polynomial time reduction from SAT problem to it.Note: Two graphs G1=(V1, E1) and G2=(V2, E2) are isomorphic if there exists a one-one and onto function f( ) from V1 to V2 such that for every two nodes u and v in V1,(u,v) is in El if and only if (f(u), f(v)) is in E2. For examples, Gl is isomorphic to asubgraph with vertices {1,2,5,4} of G2 below.G1G2121234543

Actually, graph is a non linear data structure which consisting of nodes and edges.

4. The subgraph-isomorphism problem takes two graphs G1 and G2 and asks whether Gl is isomorphic to a subgraph of G2. Show that a) the subgraph-isomorphism problem is in NP; and b) it is NP-complete by giving a polynomial time reduction from SAT problem to it. Note: Two graphs GI=(V1, E1) and G2=(V2, E2) are isomorphic if there exists a one- one and onto function f( ) from V1 to V2 such that for every two nodes u and v in V1, (u,v) is in El if and only if (f(u), f(v)) is in E2. For examples, G1 is isomorphic to a subgraph with vertices {1,2,5,4} of G2 below. GI G2 1 1 2 3 5 3

4. The subgraph-isomorphism problem takes two graphs G1 and G2 and asks whether Gl is isomorphic to a subgraph of G2. Show that a) the subgraph-isomorphism problem is in NP; and b) it is NP-complete by giving a polynomial time reduction from SAT problem to it. Note: Two graphs GI=(V1, E1) and G2=(V2, E2) are isomorphic if there exists a one- one and onto function f( ) from V1 to V2 such that for every two nodes u and v in V1, (u,v) is in El if and only if (f(u), f(v)) is in E2. For examples, G1 is isomorphic to a subgraph with vertices {1,2,5,4} of G2 below. GI G2 1 1 2 3 5 3

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 each pair of graphs G1 = <V1, E1> and G2 = <V2, E2> a) determine if they are isomorphic or not. b) Determine a function that can be isomorphic between them if they are isomorphic. Otherwise you should justify why they are not isomorphic. c) is there an Euler road or an Euler bike in anyone graph? Is Hamilton available? You should draw if the answer is yes and reason if your answer is no.
please explain fully
Please show written work with answer!! An independent set in a graph is a set of vertices no two of which are adjacent to each other. A clique is a complete subgraph of a given graph. This means that there is an edge between any two nodes in the subgraph. The maximal clique is the complete subgraph of a given graph which contains the maximum number of nodes. We know that independent set is a NP complete problem. Transform the independent set to max clique (in polynomial time) to show that Max Clique is also NP
Consider the following graph and a heuristic fucntion h. Please check if h is admissible
Please written by computer source
please answer both of the questions. 7. The Bellman-Ford algorithm for single-source shortest paths on a graph G(V,E) as discussed in class has a running time of O|V |3, where |V | is the number of vertices in the given graph. However, when the graph is sparse (i.e., |E| << |V |2), then this running time can be improved to O(|V ||E|). Describe how how this can be done.. 8. Let G(V,E) be an undirected graph such that each vertex has an even degree. Design an O(|V |+ |E|) time algorithm to direct the edges of G such that, for each vertex, the outdegree is equal to the indegree. Please give proper explanation and typed answer only.
I need the answer as soon as possible
Show the choice issue variant is NP-complete; Does a graph G have a spanning tree with a target cost c and a vertex's maximum payment?
Answer the given question with a proper explanation and step-by-step solution. Answer yes or no and Prove or explain precisely why please1. If you can solve TSP in linear time, you can solve the Hamiltonian path problemin linear time.2. If Graph Isomorphism belongs to NPC then P = NP3. The question if a program stops on an input x within n^3 steps or less belongs toNPC.4. The question does a program stops on an input x (namely there is no infiniteloop) belongs to NPC.
Q6. Given graph G = (V, E), the graph G'= (V', E') is defined such that (u,v) is in E' if and only if G contains a path with at most two edges between u and v. Describe an efficient algorithm for computing G' from G. Once develop the algorithm assuming G has an adjacency-matrix representation and once develop the algorithm assuming adjacency-list representation for the graph. Analyze the running times of your algorithms.
Elon Musk is running the graph construction business. A client has asked for a special graph. A graph is called special if it satisfies the following properties: It has <105 vertices. It is a simple, undirected, connected 3-regular graph. It has exactly k bridge edges, (k given as input). For a graph G, define f(G) to be the minimum number of edges to be removed from it to make it bipartite. The client doesn't like graphs with a high value of f, so you have to minimize it. If there doesn't exist any special graph, print -1. Otherwise, find a special graph G with the minimum possible value of f(G) and also find a subset of its edges of size f(G) whose removal makes it bipartite. In case there are multiple such graphs, you can output any of those. Elon has assigned this task to you, now you have to develop a C++ code that takes bridge edges as input and print all the possible graphs. Sample Test Case: Input Output 1 11 15 13 14 24 15 25 34 56 69 79 8 9 6 10 7 10 8 10 78 37 15 H N - 2-…
Problem 2. The half-clique problem is to determine if a graph of n vertices has a clique of at least n/2 vertices. Prove that half-clique problem is NP-complete via a polynomial time reduction from Clique problem to it.