A QUBO Formulation For the K-densest Common Subgraph Isomorphism Problem Via Quantum Annealing

In this paper, we extend the algorithm of [6] to solve the k-densest maximum common subgraph problem. By solving the k-densest maximum common subgraph isomorphism problem, we find high complexity common substructures between input graphs. We prove that our proposed objective function always gives the right answer to the corresponding QUBO problem.