PathLAD+: Towards effective exact methods for subgraph isomorphism problem

DOI10.1016/j.artint.2024.104219MaRDI QIDQ6665697

Yiyuan Wang, Chenghou Jin, Shaowei Cai

Publication date: 17 January 2025

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

optimizationsubgraph isomorphism problemexact methodlarge graphadaptive propagation method

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving subgraph isomorphism problems with constraint programming
• AllDifferent-based filtering for subgraph isomorphism
• 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
• A shortest augmenting path method for solving minimal perfect matching problems
• When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases
• The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants
• Principles and Practice of Constraint Programming – CP 2004
• 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)