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

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

The subgraph-isomorphism problem takes two graphs G1 and G2 and asks vhether G1 is isomorphic to a subgraph of G2. Show that a) the subgraph-isomorphism problem is in NP; and ) 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 in V1, (u.v) is in E1 if and only if (f(u), f(v)) is in E2. For examples, G1 is somorphic to a subgraph with vertices {1,2,5,4} of G2 below. G1 G2 1 1 2 3 4 5 3

The subgraph-isomorphism problem takes two graphs G1 and G2 and asks vhether G1 is isomorphic to a subgraph of G2. Show that a) the subgraph-isomorphism problem is in NP; and ) 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 in V1, (u.v) is in E1 if and only if (f(u), f(v)) is in E2. For examples, G1 is somorphic to a subgraph with vertices {1,2,5,4} of G2 below. G1 G2 1 1 2 3 4 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

Prove the choice problem variant is NP-complete; Exists a spanning tree with a goal cost c for a graph G and a vertex's maximum payment?
The problem Monochomatic-Subgraph-Avoidance takes as input two undirected graphs Fand G. It asks where F can be colored with two colors (say, red and blue) that does not containa monochomatic (all-red or all-blue) G as a subgraph. (Note that when G has two nodes and oneedge between them, this is equivalent to the 2-coloring problem of asking whether F can be coloredso that no neighbors have the same color.)Next, show that Monochomatic-Subgraph-Avoidance is contained in one of the classes inthe second level of the polynomial hierarchy. ALso provide an expression using qualifiers. YOU ALSO NEED TO PROVIDE A CLEAR EXPRESSION USING THE QUALIFIERS.PLEASE GIVE CLEAR EXPLAINATION.
Give proof that the adapted form of the choice problem has an NP-complete solution. Is there a spanning tree in which the highest possible payment at any vertex does not exceed the target cost, given a graph G and a target cost c?
A graph is biconnected if every pair of vertices is connectedby two disjoint paths. An articulation point in a connected graph is a vertex that woulddisconnect the graph if it (and its adjacent edges) were removed. Prove that any graphwith no articulation points is biconnected. Hint : Given a pair of vertices s and t and apath connecting them, use the fact that none of the vertices on the path are articulationpoints to construct two disjoint paths connecting s and t.
The 3-colorability problem asks, for any given undirected graph G = (V, E), whether there is a way to color each vertex in V with one of the 3 given colors such that no two adjacent vertices have the same color. Show that the 3-colorability is in NP.
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.