Counting Approximately-Shortest Paths in Directed Acyclic Graphs.
Matús MihalákRastislav SrámekPeter WidmayerPublished in: WAOA (2013)
Keyphrases
- shortest path
- directed acyclic graph
- shortest path problem
- structural learning
- equivalence class
- shortest path algorithm
- equivalence classes
- random variables
- directed graph
- road network
- conditional independence
- path length
- structural equation models
- causal models
- causal discovery
- weighted graph
- travel time
- finding the shortest path
- graphical models
- undirected graph
- flow graph
- markov property
- minimum cost flow
- minimal surface