There are Trillions of Little Forks in the Road. Choose Wisely! - Estimating the Cost and Likelihood of Success of Constrained Walks to Optimize a Graph Pruning Pipeline.
Nicolas TripoulHassan HalawaTahsin RezaGeoffrey SandersRoger PearceMatei RipeanuPublished in: IA3@SC (2018)
Keyphrases
- graph theory
- maximum likelihood
- graph model
- graph representation
- connected components
- structured data
- graph structure
- directed graph
- road surface
- total cost
- path length
- return on investment
- finding the shortest path
- road vehicles
- min sum
- graphical structure
- graph based algorithm
- maximum likelihood estimates
- likelihood function
- random walk
- search algorithm
- weighted graph
- posterior probability
- road network