Date: 2008-11-18 08:48:31

Graph theory

Mathematics

Constraint programming

Discrete mathematics

Morphisms

Constraint satisfaction problem

Graph homomorphism

Constraint satisfaction

Complexity of constraint satisfaction

Graph minor

Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

File Size: 693,20 KB