{"type":"ScholarlyArticle","title":"Solving Graph Homomorphism and Subgraph Isomorphism Problems Faster Through Clique Neighbourhood Constraints","authors":[{"name":"Sonja Kraiczy","slug":"sonja-kraiczy","given":"Sonja","family":"Kraiczy","affiliation":""},{"name":"Ciaran McCreesh","slug":"ciaran-mccreesh","given":"Ciaran","family":"McCreesh","affiliation":""}],"abstract":"Graph homomorphism problems involve finding adjacency-preserving mappings between two given graphs.  Although theoretically hard, these problems can often be solved in practice using constraint programming algorithms. We show how techniques from the state-of-the-art in subgraph isomorphism solving can be applied to broader graph homomorphism problems, and introduce a new form of filtering based upon clique-finding. We demonstrate empirically that this filtering is effective for the locally injective graph homomorphism and subgraph isomorphism problems, and gives the first practical constraint programming approach to finding general graph homomorphisms.","doi":"10.24963/ijcai.2021/193","url":"https://ijcai.org/proceedings/2021/193","pdf":"https://ijcai.org/proceedings/2021/0193.pdf","markdown":"https://ijcai.org/proceedings/2021/193.md","bibtex":"https://ijcai.org/proceedings/2021/bibtex/193","volume":{"slug":"2021","title":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2021","url":"https://ijcai.org/proceedings/2021/","year":2021,"location":"Montreal","dates":"19-27 August 2021","editors":"Prof. Zhi-Hua Zhou","isbn":"978-0-9992411-9-6","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2021"},"section":"Constraints and SAT","track":"Main Track","number":193,"pages":{"first":1396,"last":1402},"keywords":["Constraints and SAT: Constraints: Modeling, Solvers, Applications","Constraints and SAT: Constraint Satisfaction"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}