Login / Signup
On finding the longest antisymmetric path in directed acyclic graphs.
Yinglei Song
Menghong Yu
Published in:
Inf. Process. Lett. (2015)
Keyphrases
</>
directed acyclic graph
equivalence class
conditional independence
structural learning
shortest path
random variables
equivalence classes
causal discovery
directed graph
undirected graph
bayesian network structure
causal models
structural equation models
data mining
learning bayesian networks
upper bound
pairwise