DAG reversal is NP-complete.

Published in: J. Discrete Algorithms (2009)

Keyphrases

np complete
directed acyclic graph
np hard
randomly generated
satisfiability problem
computational complexity
constraint satisfaction problems
pspace complete
polynomial time complexity
bounded treewidth
conjunctive queries
np complete problems
phase transition
polynomially solvable
search algorithm
special case