Minimum connected dominating set and backbone of a random graph

Abstract

We study the minimum dominating set problem as a representative combinatorial optimization challenge with a global topological constraint. The requirement that the backbone induced by the vertices of a dominating set should be a connected subgraph makes the problem rather nontrivial to investigate by statistical physics methods. Here, we convert this global connectivity constraint into a set of local vertex constraints and build a spin glass model with only five coarse-grained vertex states. We derive a set of coarse-grained belief-propagation equations and obtain theoretical predictions of the relative sizes of the minimum dominating sets for regular random and Erdös–Rényi random graph ensembles. We also implement an efficient message-passing algorithm to construct close-to-minimum connected dominating sets and backbone subgraphs for single random graph instances. Our theoretical strategy may also be applicable to some other global topological constraints.