Close
Register
Close Window

JMU Discrete Structures II

Chapter 1 Limits to Computing

Show Source |    | About   «  1.4. NP-Completeness Proofs   ::   Contents   ::   1.6. The Independent Set Problem  »

1.5. The Clique Problem

1.5.1. The Clique Problem

CLIQUE PROBLEM

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

Try out an instance of the Clique problem on your own.

   «  1.4. NP-Completeness Proofs   ::   Contents   ::   1.6. The Independent Set Problem  »

nsf

© Copyright 2016 by OpenDSA Project Contributors and distributed under an MIT license. Last updated on Mar 12, 2019. Created using Sphinx 1.2.
Close Window