Propagation via Kernelization: The Vertex Cover Constraint - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Propagation via Kernelization: The Vertex Cover Constraint


The technique of kernelization consists in extracting, from an instance of a problem, an essentially equivalent instance whose size is bounded in a parameter k. Besides being the basis for efficient param-eterized algorithms, this method also provides a wealth of information to reason about in the context of constraint programming. We study the use of kernelization for designing propagators through the example of the Vertex Cover constraint. Since the classic kernelization rules often correspond to dominance rather than consistency, we introduce the notion of " loss-less " kernel. While our preliminary experimental results show the potential of the approach, they also show some of its limits. In particular, this method is more effective for vertex covers of large and sparse graphs, as they tend to have, relatively, smaller kernels.
Fichier principal
Vignette du fichier
paper.pdf (156.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01459870 , version 1 (07-02-2017)



Clément Carbonnel, Emmanuel Hébrard. Propagation via Kernelization: The Vertex Cover Constraint. The 22nd International Conference on Principles and Practice of Constraint Programming, Sep 2016, Toulouse, France. pp.147 - 156, ⟨10.1007/978-3-319-44953-1_10⟩. ⟨hal-01459870⟩
62 View
13 Download



Gmail Facebook X LinkedIn More