Login / Signup
Solving some NP-complete problems using split decomposition.
Michaël Rao
Published in:
Discret. Appl. Math. (2008)
Keyphrases
</>
np complete problems
np complete
graph coloring
phase transition
hard problems
satisfiability problem
combinatorial problems
sat problem
constraint satisfaction problems
job shop scheduling
np hard
scheduling problem
randomly generated