K-reach : who is in your small world

• المؤلفون الرئيسيون: Cheng, James, Shang, Zechao, Cheng, Hong, Wang, Haixun, Yu, Jeffrey Xu
• مؤلفون آخرون: School of Computer Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2014
• الموضوعات: DRNTU::Engineering::Computer science and engineering
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/102236; http://hdl.handle.net/10220/18931; http://dl.acm.org.ezlibproxy1.ntu.edu.sg/citation.cfm?id=2350247&dl=ACM&coll=DL
• المؤسسة: Nanyang Technological University

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 query vertex in the input graph. The problem of k-hop reachability is a general problem of the classic reachability (where...