Planarity Algorithm
Hey,
I can't believe I'm sat on my laptop running programs on a Quantum Computer! Super COOL! ;)
I'm working on a problem which requires detangling a network to reduce the number of crossed edges. As this is an optimisation problem, I'm hoping this can be solved using QPUs.
I've been looking through the dwave_networkx extension, but can't find any mention of the Planarity Algorithm, Hamilton Cycles or Kuratowski Subgraphs.
Does anyone have any pointers on where I can do more digging?
Many thanks in advance
Rob
Comments
Hi Rob,
The closest 'out of the box' implementation we have in Ocean is the travelling salesperson algorithm in dwave-networkx (https://github.com/dwavesystems/dwave-networkx/blob/main/dwave_networkx/algorithms/tsp.py). We are a little behind on documenting it though (see https://github.com/dwavesystems/dwave_networkx/issues/79).
There is a formulation for hamilton cycle in https://arxiv.org/abs/1302.5843.
In general we would love to get pull requests adding more algorithms to dwave-networkx!
Hope this helps,
Alex
Please sign in to leave a comment.