Compact Reachability Labeling for Graph-Structured Data

Free registration required

Executive Summary

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, the authors propose a novel approach, HLSS (Hybrid Labeling of Sub-Structures), which identifies different types of substructures within a graph and encodes them using techniques suitable to the characteristics of each of them.

  • Format: PDF
  • Size: 205.6 KB