QAOA-MaxClique
Description of Problem
This repository holds the code to a Quantum Approximate Optimization Algorithm for the Max Clique problem in Graph Theory. The maximum clique of a graph is the biggest subgraph such that all vertices in the subgraph have an edge to all other vertices in the subgraph.
Authors
- Bernardo Oviedo
- Charles Goode