PathLAD+: Towards effective exact methods for subgraph isomorphism problem
From MaRDI portal
Publication:6665697
DOI10.1016/J.ARTINT.2024.104219MaRDI QIDQ6665697FDOQ6665697
Authors: Yiyuan Wang, Chenghou Jin, Shaowei Cai 
Publication date: 17 January 2025
Published in: Artificial Intelligence (Search for Journal in Brave)
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
Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Principles and Practice of Constraint Programming – CP 2004
- The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
- Solving subgraph isomorphism problems with constraint programming
- AllDifferent-based filtering for subgraph isomorphism
- A shortest augmenting path method for solving minimal perfect matching problems
- On the complexity of submap isomorphism and maximum common submap problems
- Sequential and parallel solution-biased search for subgraph algorithms
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
- When subgraph isomorphism is really hard, and why this matters for graph databases
- Formulations for the maximum common edge subgraph problem
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)
