Space-efficient Planar Acyclicity Constraints - A Declarative Pearl - Archive ouverte HAL Access content directly
Conference Papers Year :

Space-efficient Planar Acyclicity Constraints - A Declarative Pearl

(1)
1

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.
Fichier principal
Vignette du fichier
flops16acyclicity.pdf (249.49 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01426753 , version 1 (04-01-2017)

Licence

Attribution - NonCommercial - NoDerivatives - CC BY 4.0

Identifiers

  • HAL Id : hal-01426753 , version 1

Cite

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⟩
310 View
27 Download

Share

Gmail Facebook Twitter LinkedIn More