The complexity of node blocking for dags.

Dariusz Dereniowski

Published in: J. Comb. Theory, Ser. A (2011)

Keyphrases

computational complexity
directed acyclic graph
computational cost
worst case
tree structure
databases
belief networks
database
data sets
information systems
search algorithm
np hard
graphical models
directed graph