NP-Complete Reductions: Clique, Independent Set, Vertex Cover, and Dominating Set

This lecture covers NP-Complete reductions focusing on Clique, Independent Set, Vertex Cover, and Dominating Set problems. The corrected definition for Vertex Cover is included, along with prerequisites and detailed explanations.

Algorithms with Attitude46.2K views13:23

🔥 Related Trending Topics

LIVE TRENDS

This video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!

THIS VIDEO IS TRENDING!

This video is currently trending in Bangladesh under the topic 's'.

About this video

The previous version had a flawed definition (for Vertex Cover), which has been fixed here. Table of Contents: 00:00 - Introduction and Prerequisites: 00:28 - Independent Set Definition 01:17 - Reducing Independent Set to/from Clique 02:53 - Vertex Cover Definition 03:39 - Reducing Independent Set to/from Vertex Cover 04:24 - Reduction Compositions 05:00 - NP-Hard and NP-Complete Definitions 06:02 - Proving additional problems NP-Hard 07:09 - Dominating Set Definition 08:13 - Reducing Vertex Cover to Dominating Set 12:38 - Up Next

Video Information

Views
46.2K

Total views since publication

Likes
664

User likes and reactions

Duration
13:23

Video length

Published
Jan 19, 2021

Release date

Quality
hd

Video definition

Captions
Available

Subtitles enabled

Tags and Topics

This video is tagged with the following topics. Click any tag to explore more related content and discover similar videos:

Tags help categorize content and make it easier to find related videos. Browse our collection to discover more content in these categories.