CoChat

Taming verification hardness: an efficient algorithm for testing subgraph isomorphism

Shang, Haichuan, Zhang, Ying, Lin, Xuemin, Yu, Jeffrey Xu · 2008 · Proceedings of the VLDB Endowment

The DOI matches its Crossref record; 28 of the 29 references it cites were found in a registry or an index.

Abstract

Graphs are widely used to model complicated data semantics in many applications. In this paper, we 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. Motivated by this, in the paper we firstly propose a novel and efficient algorithm for testing subgraph isomorphism, QuickSI. Secondly, we develop a new feature-based index technique to accommodate QuickSI in the filtering phase. Our extensive experiments on real and synthetic data demonstrate the efficiency and scalability of the proposed techniques, which significantly improve the existing techniques.

Overview

Integrity signals

Registry

Crossref · 10.14778/1453856.1453899

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 28 references

Research works printed but not linked: 2

  1. 10.5555/646514.695831 · doi:10.5555/646514.695831
  2. 10.5555/2993947.2993981 · doi:10.5555/2993947.2993981

Cited by

See all 494

Metadata

Authors
Shang, H., Zhang, Y., Lin, X., & Yu, J. X.
Affiliations
  • UNSW Sydney (AU)
  • Chinese University of Hong Kong (HK)
Venue
Proceedings of the VLDB Endowment
Published
2008-08
Volume
1
Issue
1
Pages
364-375
ISSN
2150-8097 (ISSN-L)
OpenAlex
W2140840007
Cited by
401
References
29
Citations by year
2026: 13 · 2025: 29 · 2024: 32 · 2023: 22 · 2022: 28 · 2021: 38 · 2020: 25 · 2019: 27 · 2018: 24 · 2017: 24 · 2016: 23 · 2015: 24 · 2014: 18 · 2013: 15 · 2012: 23
FWCI
17.28
Type
journal article
Language
en
Open access
closed
Locations
Proceedings of the VLDB Endowment (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
  • Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
  • Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
Keywords
subgraph isomorphism, graph retrieval, NP-hardness, scalability, query graph

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. https://app.cochat.ai/papers/10.14778/1453856.1453899
The paper
Shang, H., Zhang, Y., Lin, X., & Yu, J. X. (2008). Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proceedings of the VLDB Endowment. https://doi.org/10.14778/1453856.1453899

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.