Finding shortest and nearly shortest path nodes in large substantially incomplete networks.
Maksim KitsakAlexander A. GaninAhmed ElmokashfiHongzhu CuiDaniel A. EisenbergDavid L. AldersonDmitry KorkinIgor LinkovPublished in: CoRR (2022)
Keyphrases
- shortest path
- path length
- betweenness centrality
- shortest path algorithm
- edge weights
- shortest path problem
- source node
- shortest distance
- path selection
- dijkstra algorithm
- weighted graph
- routing algorithm
- road network
- network structure
- minimal surface
- finding the shortest path
- network analysis
- optimal path
- multicast tree
- social networks
- geodesic distance
- minimum spanning tree
- flow graph
- complex networks
- small world
- strongly connected components
- travel time