IJCAI 2020poster0 citations
Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions
Stephan Gocht, Ciaran McCreesh, Jakob Nordström
Abstract
Modern subgraph isomorphism solvers carry out sophisticated reasoning using graph invariants such as degree sequences and path counts. We show that all of this reasoning can be justified compactly using the cutting planes proofs studied in complexity theory. This allows us to extend a state of the art subgraph isomorphism enumeration solver with proof logging support, so that the solutions it outputs may be audited and verified for correctness and completeness by a simple third party tool which knows nothing about graph theory.
Constraints and SAT: Constraint SatisfactionConstraints and SAT: SAT: Algorithms and Techniques
BibTeX
@inproceedings{ijcai2020p158,
title = {Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions},
author = {Gocht, Stephan and McCreesh, Ciaran and Nordström, Jakob},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-20}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Christian Bessiere},
pages = {1134--1140},
year = {2020},
month = {7},
note = {Main track},
doi = {10.24963/ijcai.2020/158},
url = {https://doi.org/10.24963/ijcai.2020/158},
}