Effectively Minimize the Overall Trip Distance Using Continuous Detour Query in Spatial Network

@inproceedings{Kumar2017EffectivelyMT,
  title={Effectively Minimize the Overall Trip Distance Using Continuous Detour Query in Spatial Network},
  author={A. Sasi Kumar and G. Suseendran},
  year={2017}
}
The top-k shortest path discovery is a key process on graphs to determine k-shortest paths between a two nodes with the minimal length. This work precisely holds three processes for ranking the shortest path problem without loop by the way of using top-k shortest path join (TKSPJ) in spatial network. First, Construct transformed graph with side cost by… CONTINUE READING