Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs.

Matús Mihalák Rastislav Srámek Peter Widmayer

Published in: Theory Comput. Syst. (2016)

Keyphrases

shortest path
directed acyclic graph
shortest path algorithm
road network
shortest path problem
optimal path
travel time
path length
random variables
weighted graph
causal models
equivalence classes
structural learning