Skip to Main content Skip to Navigation
Conference papers

Space-efficient Planar Acyclicity Constraints - A Declarative Pearl

Taus Brock-Nannestad 1
1 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
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. We furthermore show how this same constraint can be used to encode connectedness constraints, and a variety of other graph-related constraints.
Document type :
Conference papers
Complete list of metadata
Contributor : Taus Brock-Nannestad Connect in order to contact the contributor
Submitted on : Wednesday, January 4, 2017 - 7:24:03 PM
Last modification on : Friday, April 30, 2021 - 10:02:40 AM
Long-term archiving on: : Wednesday, April 5, 2017 - 3:23:35 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License


  • HAL Id : hal-01426753, version 1



Taus Brock-Nannestad. Space-efficient Planar Acyclicity Constraints - A Declarative Pearl. FLOPS 2016 - 13th International Symposium on Functional and Logic Programming, Mar 2016, Kochi, Japan. ⟨hal-01426753⟩



Les métriques sont temporairement indisponibles