How to Attack the NP-Complete Dag Realization Problem in Practice.

Annabell Berger Matthias Müller-Hannemann

Published in: SEA (2012)

Keyphrases

np complete
randomly generated
satisfiability problem
np hard
directed acyclic graph
computational complexity
constraint satisfaction problems
malicious users
pspace complete
polynomial time complexity
bounded treewidth
countermeasures
objective function
learning algorithm
np complete problems
real world
databases