720 search results - page 125 / 144 » Nonrepetitive colorings of graphs |
IANDC
2007
13 years 7 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
AI
2005
Springer
13 years 7 months ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
CAD
2002
Springer
13 years 7 months ago
2002
Springer
This paper presents a method for three-dimensional surface flattening, which can be efficiently used in threedimensional computer aided garment design. First, facet model is used ...
RSA
2008
13 years 7 months ago
2008
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
ICTAI
2009
IEEE
13 years 5 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...