The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
GraphGrep: A fast and universal method for querying graphs
Abstract
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expression graph query language Glide that combines features from Xpath and Smart. Glide incorporates both single node and variable-length wildcards. Our algorithm uses hash-based fingerprinting to represent the graphs in an abstract form and to filter the database. GraphGrep has been tested on databases of size up to 16,000 molecules and performs well in this entire range.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Weininger, D. (1988) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci00057a005 · Cited by 7,436
Cited by
Survey of graph database models
Angles, R., & Gutierrez, C. (2008) · ACM Computing Surveys · doi:10.1145/1322432.1322433 · Cited by 1,706
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Shang, H., Zhang, Y., Lin, X., & Yu, J. X. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453899 · Cited by 401
POIROT: Aligning Attack Behavior with Kernel Audit Records for Cyber Threat Hunting
Milajerdi, S. M., Eshete, B., Gjomemo, R., & Venkatakrishnan, V. N. (2019) · Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3319535.3363217 · Cited by 300
Metadata
- Authors
- Giugno, R., & Shasha, D.
- Venue
- Object recognition supported by user interaction for service robots
- Publisher
- IEEE Comput. Soc
- Published
- 2003-06-25
- Volume
- 2
- Pages
- 112-115
- OpenAlex
- W2145631416
- Cited by
- 225
- References
- 1
- FWCI
- 6.17
- Type
- conference paper
- Language
- en
- Open access
- closed
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: GraphGrep: A fast and universal method for querying graphs. https://app.cochat.ai/papers/10.1109/icpr.2002.1048250
- The paper
- Giugno, R., & Shasha, D. (2003). GraphGrep: A fast and universal method for querying graphs. Object recognition supported by user interaction for service robots. https://doi.org/10.1109/icpr.2002.1048250
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.