Implementations of modern convex optimization-based graph algorithms in Python. Available on the Python Package Index (PyPI).
-
Updated
Jul 18, 2019 - Python
Implementations of modern convex optimization-based graph algorithms in Python. Available on the Python Package Index (PyPI).
Supporting code for "Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration".
Custom unembedding techniques for quantum annealers
Add a description, image, and links to the maximum-cut topic page so that developers can more easily learn about it.
To associate your repository with the maximum-cut topic, visit your repo's landing page and select "manage topics."