The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
DOI10.1007/978-3-030-51372-6_19zbMATH Open1502.68241OpenAlexW3025380722MaRDI QIDQ5100743FDOQ5100743
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
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
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)
Cites Work
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Title not available (Why is that?)
- On the subgraph epimorphism problem
- Recording and minimizing nogoods from restarts
- Solving subgraph isomorphism problems with constraint programming
- Bigraphs with sharing
- AllDifferent-based filtering for subgraph isomorphism
- Efficient graph rewriting and its implementation
- Sequential and parallel solution-biased search for subgraph algorithms
- 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
- Solving subgraph isomorphism problems with constraint programming
- Pitfalls and shortcomings for decompositions and alignment
- SLF: a passive parallelization of subgraph isomorphism
- PathLAD+: Towards effective exact methods for subgraph isomorphism problem
- Title not available (Why is that?)
Uses Software
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)
