Subgraph Isomorphism Meets Cutting Planes: Solving with Certified Solutions

Gocht, S., Mccreesh, C. and Nordström, J. (2020) Subgraph Isomorphism Meets Cutting Planes: Solving with Certified Solutions. In: 2020 International Joint Conference on Artificial Intelligence (IJCAI-PRICAI 2020), Yokohama, Japan, 11-17 Jul 2020, pp. 1134-1140. ISBN 9780999241165 (doi: 10.24963/ijcai.2020/158)

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.

• Item Type: Conference Proceedings
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Mccreesh, Dr Ciaran
• Authors: Gocht, S., Mccreesh, C., and Nordström, J.
• College/School: College of Science and Engineering > School of Computing Science
• ISBN: 9780999241165

Project Code	Award No	Project Name	Principal Investigator	Funder's Name	Funder Ref	Lead Dept
300525		Modelling and Optimisation with Graphs	Patrick Prosser	Engineering and Physical Sciences Research Council (EPSRC)	EP/P026842/1	Computing Science