The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants

DOI10.1007/978-3-030-51372-6_19MaRDI QIDQ5100743zbMATHOpenAlexFDO

Authors Ciaran McCreesh, Patrick Prosser, James Trimble

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)

Recommendations

• Solving subgraph isomorphism problems with constraint programming
• AllDifferent-based filtering for subgraph isomorphism
• scientific article; zbMATH DE number 1629832
• Filtering for Subgraph Isomorphism
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Cites work

• scientific article; zbMATH DE number 3341276 (Why is no real title available?)
• AllDifferent-based filtering for subgraph isomorphism
• Bigraphs with sharing
• Efficient graph rewriting and its implementation
• Locally constrained graph homomorphisms -- structure, complexity, and applications
• On the subgraph epimorphism problem
• Recording and minimizing nogoods from restarts
• Sequential and parallel solution-biased search for subgraph algorithms
• Solving subgraph isomorphism problems with constraint programming
• The secret life of keys: on the calculation of mechanical lock systems
• When subgraph isomorphism is really hard, and why this matters for graph databases

Cited in

(6)

• Finding subgraphs with side constraints
• SLF: a passive parallelization of subgraph isomorphism
• Solving subgraph isomorphism problems with constraint programming
• Pitfalls and shortcomings for decompositions and alignment
• scientific article; zbMATH DE number 1629832 (Why is no real title available?)
• PathLAD+: Towards effective exact methods for subgraph isomorphism problem

Describes a project that uses

Uses Software

• Glasgow subgraph solver
• vf3lib

This page was built for publication: The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100743)