Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
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.
Original language | English |
---|---|
Title of host publication | Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI '20) |
Number of pages | 7 |
Publisher | International Joint Conferences on Artificial Intelligence |
Publication date | 1 Jul 2020 |
Pages | 1134-1140 |
DOIs | |
Publication status | Published - 1 Jul 2020 |
Event | 29th International Joint Conference on Artificial Intelligence (IJCAI-20) - Yokohama / Virtuel, Japan Duration: 7 Jan 2021 → 15 Jan 2021 |
Conference
Conference | 29th International Joint Conference on Artificial Intelligence (IJCAI-20) |
---|---|
Land | Japan |
By | Yokohama / Virtuel |
Periode | 07/01/2021 → 15/01/2021 |
ID: 251872320