PathLAD+: Towards effective exact methods for subgraph isomorphism problem
From MaRDI portal
Publication:6665697
Recommendations
- The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
- Algorithms for subgraph isomorphism in graph pattern mining
- AllDifferent-based filtering for subgraph isomorphism
- A new algorithm for induced subgraph isomorphism
- VF2++ -- an improved subgraph isomorphism algorithm
Cites work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A shortest augmenting path method for solving minimal perfect matching problems
- AllDifferent-based filtering for subgraph isomorphism
- Formulations for the maximum common edge subgraph problem
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
- On the complexity of submap isomorphism and maximum common submap problems
- Principles and Practice of Constraint Programming – CP 2004
- Sequential and parallel solution-biased search for subgraph algorithms
- Solving subgraph isomorphism problems with constraint programming
- The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
- When subgraph isomorphism is really hard, and why this matters for graph databases
This page was built for publication: PathLAD+: Towards effective exact methods for subgraph isomorphism problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665697)