Finding subgraphs with side constraints

The subgraph isomorphism problem is to find a small “pattern” graph inside a larger “target” graph. There are excellent dedicated solvers for this problem, but they require substantial programming effort to handle the complex side constraints that often occur in practical applications of the problem; however, general purpose constraint solvers struggle on more difficult graph instances. We show how to combine the state of the art Glasgow Subgraph Solver with the Minion constraint programming solver to get a “subgraphs modulo theories” solver that is both performant and flexible. We also show how such an approach can be driven by the Essence high level modelling language, giving ease of modelling and prototyping to non-expert users. We give practical examples involving temporal graphs, typed graphs from software engineering, and costed subgraph isomorphism problems.

Citation

Akgün , Ö , Enright , J , Jefferson , C , McCreesh , C , Prosser , P & Zschaler , S 2021 , Finding subgraphs with side constraints . in P J Stuckey (ed.) , Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 12735 LNCS , Springer , Cham , pp. 348-364 , 18th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2021 , Virtual, Online , 5/07/21 . https://doi.org/10.1007/978-3-030-78230-6_22

conference

Publication

Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Proceedings

DOI

https://doi.org/10.1007/978-3-030-78230-6_22

ISSN

0302-9743

Type

Conference item

Rights

Copyright © Springer Nature Switzerland AG 2021. This work has been made available online in accordance with publisher policies or with permission. Permission for further reuse of this content should be sought from the publisher or the rights holder. This is the author created accepted manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1007/978-3-030-78230-6_22.

Description

This research was supported by the Engineering and Physical Sciences Research Council [grant number EP/P026842/1].