Propagation via Kernelization: The Vertex Cover Constraint

CP, Volume abs/1702.02470, 2016.

Cited by: 8|Views20


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 parameterized algorithms, this method also provides a wealth of information to reason about in the context of constraint programming. We st...More



Get fulltext within 24h
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 280 coins

Wechat's Red Packet

Upload 200 articles

for 1200 coins

Wechat's Red Packet

Upload 500 articles

for 3000 coins

Wechat's Red Packet

Upload 1000 articles

for 7000 coins

Wechat's Red Packet
Your rating :