Data Management

Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism

Download Now Free registration required

Executive Summary

Graphs are widely used to model complicated data semantics in many applications. In this paper, the authors aim to develop efficient techniques to retrieve graphs, containing a given query graph, from a large set of graphs. Considering the problem of testing subgraph isomorphism is generally NP-hard, most of the existing techniques are based on the framework of filtering-and-verification to reduce the precise computation costs; consequently various novel feature-based indexes have been developed. While the existing techniques work well for small query graphs, the verification phase becomes a bottleneck when the query graph size increases.

  • Format: PDF
  • Size: 604.31 KB