Access the full text.
Sign up today, get DeepDyve free for 14 days.
U Feige (1998)
A threshold of ln n for approximating set coverJ. ACM, 45
SN Dorogovtsev, JFF Mendes, AN Samukhin (2000)
Structure of growing networks with preferential linkingPhys. Rev. Lett., 85
HV Jagadish (1990)
A compression technique to materialize transitive closureACM Trans. Database Syst., 15
MEJ Newman (2003)
The structure and function of complex networksSIAM Rev., 45
R Jin, L Liu, B Ding, H Wang (2011)
Distance-constraint reachability computation in uncertain graphsPVLDB, 4
R Jin, N Ruan, Y Xiang, H Wang (2011)
Path-tree: An efficient reachability indexing scheme for large directed graphsACM Trans. Database Syst., 36
K Simon (1988)
An improved algorithm for transitive closure on acyclic digraphsTheor. Comput. Sci., 58
H Yildirim, V Chaoji, MJ Zaki (2010)
Grail: Scalable reachability index for large graphsPVLDB, 3
J Cheng, Z Shang, H Cheng, H Wang, JX Yu (2012)
K-reach: Who is in your small worldPVLDB, 5
DS Hochbaum (1997)
Approximation Algorithms for NP-hard Problems
TH Cormen, CE Leiserson, RL Rivest, C Stein (2009)
Introduction to Algorithms
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$$ k , from a source query vertex to a target query vertex in the input graph. The problem of $$k$$ k -hop reachability is a general problem of the classic reachability (where $$k=\infty $$ k = ∞ ). Existing indexes for processing classic reachability queries, as well as for processing shortest path distance queries, are not applicable or not efficient for processing $$k$$ k -hop reachability queries. We propose an efficient index for processing $$k$$ k -hop reachability queries. Our experimental results on a wide range of real datasets show that our method is efficient and scalable in terms of both index construction and query processing.
The VLDB Journal – Springer Journals
Published: Apr 1, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.