Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/lanl/decomposition-algorithms-for-scalable-quantum-annealing
Graph decomposition algorithms for MaxClique and Minimum Vertex Cover problems
https://github.com/lanl/decomposition-algorithms-for-scalable-quantum-annealing
algorithm dwave dwave-quantum-annealer graph-algorithms graph-decomposition graph-theory maximum-clique minimum-vertex-cover quantum-annealing quantum-computing
Last synced: about 1 month ago
JSON representation
Graph decomposition algorithms for MaxClique and Minimum Vertex Cover problems
- Host: GitHub
- URL: https://github.com/lanl/decomposition-algorithms-for-scalable-quantum-annealing
- Owner: lanl
- Created: 2021-01-19T22:58:59.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2022-02-04T07:47:04.000Z (almost 3 years ago)
- Last Synced: 2024-06-27T00:20:05.482Z (7 months ago)
- Topics: algorithm, dwave, dwave-quantum-annealer, graph-algorithms, graph-decomposition, graph-theory, maximum-clique, minimum-vertex-cover, quantum-annealing, quantum-computing
- Language: Python
- Homepage:
- Size: 20.5 KB
- Stars: 5
- Watchers: 3
- Forks: 3
- Open Issues: 0