Fast Computation of Reachability Labeling for Large Graphs

  title={Fast Computation of Reachability Labeling for Large Graphs},
  author={Jiefeng Cheng and Jeffrey Xu Yu and Xuemin Lin and Haixun Wang and Philip S. Yu},
The need of processing graph reachability queries stems fro m many applications that manage complex data as graphs. The applic tions include transportation network, Internet traffic analyzing, Web navigat on, semantic web, chemical informatics and bio-informatics systems, and compute r vision. A graph reachability query, as one of the primary tasks, is to find whether t wo given data objects,u andv, are related in any ways in a large and complex dataset. Forma lly, the query is about to find if… CONTINUE READING
Highly Cited
This paper has 98 citations. REVIEW CITATIONS


Publications citing this paper.

99 Citations

Citations per Year
Semantic Scholar estimates that this publication has 99 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 25 references

Approximation algorithms for combinatori al problems

  • D. S. Johnson
  • InProc. of STOC’73,
  • 1973
Highly Influential
18 Excerpts

Similar Papers

Loading similar papers…