Order:
See also
  1.  11
    Finding the Shortest Path with Vertex Constraint over Large Graphs.Yajun Yang, Zhongfei Li, Xin Wang & Qinghua Hu - 2019 - Complexity 2019:1-13.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  5
    The Memory Effect of Reflected Self-Appraisals on Different Types of Others.Caizhen Yue, Yajun Yang, Weijie He, Tong Yue & Weigang Pan - 2020 - Frontiers in Psychology 11.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  4
    A Novel Index Method for K Nearest Object Query over Time-Dependent Road Networks.Yajun Yang, Hanxiao Li, Junhu Wang, Qinghua Hu, Xin Wang & Muxi Leng - 2019 - Complexity 2019:1-18.
    Knearest neighbor search is an important problem in location-based services and has been well studied on static road networks. However, in real world, road networks are often time-dependent; i.e., the time for traveling through a road always changes over time. Most existing methods forkNN query build various indexes maintaining the shortest distances for some pairs of vertices on static road networks. Unfortunately, these methods cannot be used for the time-dependent road networks because the shortest distances always change over time. To (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark