Files in this item
Finding subgraphs with side constraints
Item metadata
dc.contributor.author | Akgün, Özgür | |
dc.contributor.author | Enright, Jessica | |
dc.contributor.author | Jefferson, Christopher | |
dc.contributor.author | McCreesh, Ciaran | |
dc.contributor.author | Prosser, Patrick | |
dc.contributor.author | Zschaler, Steffen | |
dc.contributor.editor | Stuckey, Peter J. | |
dc.date.accessioned | 2021-10-28T16:30:03Z | |
dc.date.available | 2021-10-28T16:30:03Z | |
dc.date.issued | 2021-07-05 | |
dc.identifier | 275707735 | |
dc.identifier | d586090d-1c36-443d-a26e-5656438fc8ab | |
dc.identifier | 85111464769 | |
dc.identifier | 000885083100022 | |
dc.identifier.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 - 18 th international conference, CPAIOR 2021, proceedings . Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and Lecture notes in bioinformatics) , vol. 12735 , 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 | en |
dc.identifier.citation | conference | en |
dc.identifier.isbn | 9783030782290 | |
dc.identifier.isbn | 9783030782306 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.other | ORCID: /0000-0003-2979-5989/work/99465968 | |
dc.identifier.other | ORCID: /0000-0001-9519-938X/work/99466041 | |
dc.identifier.uri | https://hdl.handle.net/10023/24216 | |
dc.description | Funding: This research was supported by the Engineering and Physical Sciences Research Council [grant number EP/P026842/1]. | en |
dc.description.abstract | 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. | |
dc.format.extent | 17 | |
dc.format.extent | 1033116 | |
dc.language.iso | eng | |
dc.publisher | Springer | |
dc.relation.ispartof | Integration of constraint programming, artificial intelligence, and operations research - 18th international conference, CPAIOR 2021, proceedings | en |
dc.relation.ispartofseries | Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and Lecture notes in bioinformatics) | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | Computer Science(all) | en |
dc.subject | Theoretical Computer Science | en |
dc.subject | T-NDAS | en |
dc.subject | AC | en |
dc.subject | MCC | en |
dc.subject.lcc | QA75 | en |
dc.title | Finding subgraphs with side constraints | en |
dc.type | Conference item | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.contributor.institution | University of St Andrews. Centre for Research into Equality, Diversity & Inclusion | en |
dc.contributor.institution | University of St Andrews. St Andrews GAP Centre | en |
dc.identifier.doi | 10.1007/978-3-030-78230-6_22 | |
dc.date.embargoedUntil | 2021-06-17 | |
dc.identifier.url | https://doi.org/10.1007/978-3-030-78230-6 | en |
dc.identifier.url | http://eprints.gla.ac.uk/239426/ | en |
dc.identifier.grantnumber | EP/P026842/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.