The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants

DOI10.1007/978-3-030-51372-6_19zbMath1502.68241OpenAlexW3025380722MaRDI QIDQ5100743

James Trimble, Ciaran McCreesh, Patrick Prosser

Publication date: 1 September 2022

Published in: Graph Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-51372-6_19

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Software, source code, etc. for problems pertaining to computer science (68-04)

Related Items

Pitfalls and shortcomings for decompositions and alignment ⋮ Finding subgraphs with side constraints

Uses Software

• Glasgow subgraph solver
• vf3lib

Cites Work

• Unnamed Item
• Unnamed Item
• Locally constrained graph homomorphisms -- structure, complexity, and applications
• Solving subgraph isomorphism problems with constraint programming
• On the subgraph epimorphism problem
• AllDifferent-based filtering for subgraph isomorphism
• Efficient graph rewriting and its implementation
• Sequential and parallel solution-biased search for subgraph algorithms
• Bigraphs with sharing
• When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases
• The Secret Life of Keys: On the Calculation of Mechanical Lock Systems