Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs.
Adam KarczmarzJakub PawlewiczPiotr SankowskiPublished in: CoRR (2021)
Keyphrases
- average case
- shortest path
- weighted graph
- finding the shortest path
- edge weights
- betweenness centrality
- worst case
- worst case analysis
- uniform distribution
- graph model
- graph partitioning
- shortest path algorithm
- graph search
- complex networks
- vc dimension
- average case complexity
- strongly connected components
- geodesic distance
- machine learning
- travel time
- optimal path
- path length
- road network
- special case
- bipartite graph
- minimal surface
- directed graph
- dynamic programming
- active learning
- high dimensional