Question: Define HYPER-COMMUNITY to be the problem that takes a collection of n web pages and an integer k, and determines if there are k web
Define HYPER-COMMUNITY to be the problem that takes a collection of n web pages and an integer k, and determines if there are k web pages that all contain hyperlinks to each other. Show that HYPER-COMMUNITY is NP-complete.
Step by Step Solution
3.45 Rating (158 Votes )
There are 3 Steps involved in it
HYPERCOMMUNITY can be shown to be NPcomplete by reducing a known NPcomplete problem to it To do so w... View full answer
Get step-by-step solutions from verified subject matter experts
