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
icon
Related questions
Question
4. The subgraph-isomorphism problem takes two graphs Gl 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 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 a
subgraph with vertices {1,2,5,4} of G2 below.
G1
G2
1
2
1
2
3
4
5
4
3
Transcribed Image Text:4. The subgraph-isomorphism problem takes two graphs Gl 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 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 a subgraph with vertices {1,2,5,4} of G2 below. G1 G2 1 2 1 2 3 4 5 4 3
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Single source shortest path
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education