8 search results - page 2 / 2 » Oriented Hamiltonian Cycles in Tournaments |
62
Voted
JCT
2000
14 years 9 months ago
2000
AI
2005
Springer
14 years 9 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...
WG
2004
Springer
15 years 2 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...