Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Introduction to the Clique Problem | Presentation | Slideshow demonstrating the Clique problem. | OpenDSA | Clique Problem |
| 2 | Clique Proficency Exercise | Proficiency Exercise | User must determine the largest clique in a given graph. | OpenDSA | Clique Problem |
| 3 | Reduction of Clique to Independent Set Slideshow | Presentation | Slideshow demonstrating a reduction from an instance of the Clique problem to an instance of the Independent Set problem. | OpenDSA | Reduction, Clique Problem, Independent Set Problem |
| 4 | Reduction of 3-SAT to Clique Slideshow | Presentation | Slideshow demonstrating a reduction from an instance of the 3-Satisfiability problem to an instance of the Clique problem. | OpenDSA | Reduction, Satisfiability Problem, Clique Problem |
| 5 | Proof that 3-SAT is NP-Complete Slideshow | Proof Visualization | Slideshow demonstrating that 3-Satisfiability is NP-Complete by a reduction from Satisfiability. | OpenDSA | Clique Problem |
| 6 | Reduction of Hamiltonian Cycle to Traveling Salesman Slideshow | Presentation | Slideshow demonstrating a reduction from an instance of the Hamiltonian Cycle problem to an instance of the Traveling Salesman problem. | OpenDSA | Reduction, Clique Problem, Independent Set Problem |