Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths
CIKM, pp. 1601-1606, 2013.
large index spaceonline-search-based methods answerindexing timereachability queryquery timeMore(8+)
Answering reachability queries on directed graphs is ubiquitous in many applications involved with graph-shaped data as one of the most fundamental and important operations. However, it is still highly challenging to efficiently process them on large-scale graphs. Transitive-closure-based methods consume prohibitively large index space, a...More
Full Text (Upload PDF)
PPT (Upload PPT)