Counting approximately-shortest paths in directed acyclic graphs
Matús MihalákRastislav SrámekPublished in: CoRR (2013)
Keyphrases
- directed acyclic graph
- shortest path
- shortest path problem
- equivalence class
- shortest path algorithm
- random variables
- equivalence classes
- structural learning
- conditional independence
- road network
- causal models
- finding the shortest path
- directed graph
- optimal path
- undirected graph
- path length
- travel time
- minimum cost flow
- weighted graph
- minimal surface
- flow graph
- special case
- structural equation models
- strongly connected components