The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants
Open accessAbstract
The Glasgow Subgraph Solver provides an implementation of state of the art algorithms for subgraph isomorphism problems. It combines constraint programming concepts with a variety of strong but fast domain-specific search and inference techniques, and is suitable for use on a wide range of graphs, including many that are found to be computationally hard by other solvers. It can also be equipped with side constraints, and can easily be adapted to solve other subgraph matching problem variants. We outline its key features from the view of both users and algorithm developers, and discuss future directions.
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.
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?
The cited source says what the claim attributes to it.
In the citing paper
“We use the powerful Glasgow Subgraph Solver 70 for this mapping.”
From Beyond-classical computation in quantum simulation (2025) · cites this paper as [70]
The cited source says what the claim attributes to it.
In the citing paper
“Although there are graph-based approaches that are potentially less vulnerable to such attacks, they are not feasible in practice [24] due to the NP nature of determining subgraph isomorphism [25,29,45].”
From Detecting Automatic Software Plagiarism via Token Sequence Normalization (2024) · cites this paper as [29]
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
A (sub)graph isomorphism algorithm for matching large graphs
Cordella, L. P., Foggia, P., Sansone, C., & Vento, M. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.75 · Cited by 1,477
Modulation of Genetic Associations with Serum Urate Levels by Body-Mass-Index in Humans
Huffman, J. E., Albrecht, E., Teumer, A., Mangino, M., Kapur, K., Johnson, T., Kutalik, Z., Pirastu, N., Pistis, G., Lopez, L. M., et al. (2015) · PLOS ONE · doi:10.1371/journal.pone.0119752 · Cited by 1,227
A filtering algorithm for constraints of difference in CSPs
Régin, J.-C. (1994) · National Conference on Artificial Intelligence · Cited by 657
Sims, C. C. (1970) · Elsevier eBooks · doi:10.1016/b978-0-08-012975-4.50020-5 · Cited by 294
A subgraph isomorphism algorithm and its application to biochemical data
Bonnici, V., Giugno, R., Pulvirenti, A., Shasha, D. E., & Ferro, A. (2013) · BMC Bioinformatics · doi:10.1186/1471-2105-14-s7-s13 · Cited by 220
Biomolecular network motif counting and discovery by color coding
Alon, N., Dao, P., Hajirasouliha, I., et al. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn163 · Cited by 219
AllDifferent-based filtering for subgraph isomorphism
Solnon, C. (2010) · Artificial Intelligence · doi:10.1016/j.artint.2010.05.002 · Cited by 150
Solving subgraph isomorphism problems with constraint programming
Zampelli, S., Deville, Y., & Solnon, C. (2009) · Constraints · doi:10.1007/s10601-009-9074-3 · Cited by 98
Introducing VF3: A New Algorithm for Subgraph Isomorphism
Carletti, V., Foggia, P., Saggese, A., et al. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-58961-9_12 · Cited by 77
Efficient Graph Rewriting and Its Implementation
(1995) · Lecture notes in computer science · doi:10.1007/bfb0031909 · Cited by 70
Cited by
Beyond-classical computation in quantum simulation
King, A. D., Nocera, A., Rams, M. M., Dziarmaga, J., Wiersema, R., Bernoudy, W., Raymond, J., Kaushal, N., Heinsdorf, N., Harris, R., et al. (2025) · Science · doi:10.1126/science.ado6285 · Cited by 138
Tutorial: calibration refinement in quantum annealing
Chern, K., Boothby, K., Raymond, J., Farré, P., & King, A. D. (2023) · Frontiers in Computer Science · doi:10.3389/fcomp.2023.1238988 · Cited by 11
Detecting Automatic Software Plagiarism via Token Sequence Normalization
Sağlam, T., Brödel, M., Schmid, L., & Hahner, S. (2024) · Proceedings of the IEEE/ACM 46th International Conference on Software Engineering · doi:10.1145/3597503.3639192 · Cited by 9
Metadata
- Authors
- McCreesh, C., Prosser, P., & Trimble, J.
- Affiliations
- University of Glasgow (GB)
- Corresponding author
- McCreesh, Ciaran
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2020
- Pages
- 316-324
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- PMC
- PMC7314700
- OpenAlex
- W3025380722
- Cited by
- 57
- References
- 29
- Citations by year
- 2026: 4 · 2025: 10 · 2024: 16 · 2023: 12 · 2022: 6 · 2021: 8 · 2020: 1
- FWCI
- 2.08
- Type
- conference paper
- Language
- en
- Open access
- green
- www.ncbi.nlm.nih.gov
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Lecture notes in computer science (publishedVersion)
- PubMed Central (publishedVersion)
- ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam) (submittedVersion, cc-by-sa)
- Funders
- Engineering and Physical Sciences Research Council (1804156, EP/P026842/1)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Constraint Satisfaction and Optimization
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Keywords
- subgraph isomorphism, subgraph matching, constraint programming, domain-specific search, inference techniques, side constraints, graph algorithms
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: The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants. https://app.cochat.ai/papers/10.1007/978-3-030-51372-6_19
- The paper
- McCreesh, C., Prosser, P., & Trimble, J. (2020). The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-51372-6_19
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.
