Login / Signup
On the hardness of finding near-optimal multicuts in directed acyclic graphs.
Cédric Bentz
Published in:
Theor. Comput. Sci. (2011)
Keyphrases
</>
directed acyclic graph
structural learning
equivalence class
conditional independence
random variables
bayesian network structure
computational complexity
directed graph
causal models
np hard
rough sets
phase transition
equivalence classes