Graph Partitioning with Discrete Quadratic Model
I have been working in the past on the graph partitioning problem using a BQM (see e.g. arXiv:1705.03082). For my own education, I was wondering if there is any public example showing how to implement graph partitioning with N > 2 classes using a Discrete Quadratic Model, similarly to what is presented for the graph colouring in the documentation.
Thank you in advance,