2 search results - page 1 / 1 » On digraph coloring problems and treewidth duality |
EJC
2008
13 years 4 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
MFCS
2007
Springer
13 years 10 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...