Show the Wrestler’s Wedding Problem is NP-complete. Question : Is there a weddin

Question

Show the Wrestler’s Wedding Problem is NP-complete.

Question : Is there a wedding party of size K?

Show the Wrestler's Wedding Problem is NP-complete. Instance : A set W = {wi,w2, ,wn} of professional wrestlers, a collection of unordered pairs T =(tví, ty)lu,Wy E.W) where (tvi ,WyjeT means that the wrestlers wi and wi will attack each other if in the same room, and an integer K 0 Question Is there a wedding party of size K? (i.e., Is there a subset PC W such that if wi P and wi E P then (wi, wj) T.)

Explanation / Answer

Ans :   Yes

       There can be a wedding party of size 1. where (w1,w1) can be in the same room and thus can belong to T and also w1 belongs to P and it can be a subset of T.

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.