1 citations · 1 across the 2 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Faster algorithms for graph homomorphism via tractable constraint satisfaction
Clément Carbonnel
We show that the existence of a homomorphism from an -vertex graph to an -vertex graph can be decided in time and polynomial space if comes fro…
cs.CC2016
The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable
Clément Carbonnel
Given a fixed constraint language , the conservative CSP over (denoted by c-CSP()) is a variant of CSP() where the domain of each variable can be restricted arbitraril…