Space-efficient acyclicity constraints: A declarative pearl

Abstract

Many constraints on graphs, e.g. the existence of a simple path between two vertices, or the connectedness of the subgraph induced by some selection of vertices, can be straightforwardly represented by means of a suitable acyclicity constraint. One method for encoding such a constraint in terms of simple, local constraints uses a 3-valued variable for each edge, and an ( N + 1 ) -valued variable for each vertex, where N is the number of vertices in the entire graph. For graphs with many vertices, this can be somewhat inefficient in terms of space usage. In this paper, we show how to refine this encoding into one that uses only a single bit of information, i.e. a 2-valued variable, per vertex, assuming the graph in question is planar. More generally, for graphs that are embeddable in genus g (i.e. on a torus with g handles), we show that 2 g + 1 bits per vertex suffices. We furthermore show how this same constraint can be used to encode connectedness constraints, and a variety of other graph-related constraints. • An acyclicity encoding for planar graphs using a single bit per vertex is shown. • An extension of this encoding to general graphs is presented. • Various other graph constraints are encoded in terms of acyclicity.