A note on approximating the min-max vertex disjoint paths on directed acyclic graphs.
Bang Ye WuPublished in: J. Comput. Syst. Sci. (2011)
Keyphrases
- min max
- disjoint paths
- undirected graph
- directed acyclic graph
- directed graph
- equivalence class
- max min
- causal models
- equivalence classes
- markov models
- bayesian network structure
- random variables
- random walk
- structural learning
- causal reasoning
- causal discovery
- conditional independence
- bayesian networks
- connected components
- gray scale
- special case
- lower bound