Consider the following generalization of the maximum matching problem, which we call Strict-Matching. Recall that a matching in an undirected graph G = (V, E) is a set of edges such that no distinct pair of edges {a, b} and {c, d} have endpoints that are equal: {a, b} ∩ {c, d} = ∅. Say that a strict matching is matching with the property that no pair of distinct edges have endpoints that are connected by an edge: {a, c} ̸∈ E, {a, d} ̸∈ E, {b, c} ̸∈ E, and {b, d} ̸∈ E.

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

Exercise c. Strict matching
Consider the following generalization of the maximum matching problem, which we call
Strict-Matching. Recall that a matching in an undirected graph G = (V, E) is a set
of edges such that no distinct pair of edges {a, b} and {c, d} have endpoints that are
equal: {a, b} ∩ {c, d} = ∅. Say that a strict matching is matching with the property
that no pair of distinct edges have endpoints that are connected by an edge: {a, c} ̸∈ E,
{a, d} ̸∈ E, {b, c} ̸∈ E, and {b, d} ̸∈ E. (Since a strict matching is also a matching, we
also require {a, b} ∩ {c, d} = ∅.) The problem Strict-Matching is then given a graph
G and an integer k, does G contain a strict matching with at least k edges.
Prove that Strict-Matching is NP-complete. 

Expert Solution
Step 1

Answer:

The proof that Strict-Matching is NP-complete is shown through a reduction from the well-known NP-complete problem Maximum Independent Set (MIS), which is defined as follows: Given an undirected graph G = (V, E) and an integer k, does G contain an independent set with at least k nodes, where an independent set is a set of vertices such that no two vertices are connected by an edge.

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

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