Planarity Algorithm


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




1 comment

Please sign in to leave a comment.

Didn't find what you were looking for?

New post