3 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.DS2013
Backward Path Growth for Efficient Mobile Sequential Recommendation
Jianbin Huang, Xuejun Huangfu, Heli Sun +2
The problem of mobile sequential recommendation is presented to suggest a route connecting some pick-up points for a taxi driver so that he/she is more likely to get passengers wit…
cs.SI2013★ 2 cited
Random-walk domination in large graphs: problem definitions and fast solutions
Rong-Hua Li, Jeffrey Xu Yu, Xin Huang +1
We introduce and formulate two types of random-walk domination problems in graphs motivated by a number of applications in practice (e.g., item-placement problem in online social n…
cs.DB2012★ 3 cited
K-Reach: Who is in Your Small World
James Cheng, Zechao Shang, Hong Cheng +2
We study the problem of answering k-hop reachability queries in a directed graph, i.e., whether there exists a directed path of length k, from a source query vertex to a target que…