How to Attack the NP-complete Dag Realization Problem in Practice

Annabell Berger Matthias Müller-Hannemann

Published in: CoRR (2012)

Keyphrases

np complete
randomly generated
satisfiability problem
directed acyclic graph
pspace complete
np hard
polynomial time complexity
constraint satisfaction problems
bounded treewidth
genetic algorithm
case study
computational complexity
countermeasures
ddos attacks