Solving the minimum dominating set problem with instance-specific hardware on FPGAs

This paper presents an instance specific hardware algorithm for finding a minimum dominating set of a given graph. The proposed algorithm is constructed according to a given instance of graph, and can find a minimum dominating set efficiently based on branch and bound search. Experimental results showed that, compared with the software solver, the proposed algorithm implemented on FPGAs produced a minimum dominating set in a much shorter running time even if the time for circuit synthesis and configuration of FPGA was taken into account