A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
Compact reachability labeling for graph-structured data
Proceedings of the 14th ACM international conference on Information and knowledge management - CIKM '05
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, biological and ontology databases inferencing as well as XML query processing. Various approaches have been proposed to encode graph reachability information using node labeling schemes, but most existing schemes only work well for specific types of graphs. In this paper, we propose a novel approach, HLSS(Hierarchicaldoi:10.1145/1099554.1099708 dblp:conf/cikm/HeWYY05 fatcat:dj4ul5wmifb2jdxg5jm2ywyn5y