A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental Graphs

McCreesh, C. and Prosser, P. (2015) A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental Graphs. In: 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland, 31 Aug -04 Sep 2015, pp. 295-312. ISBN 9783319232188 (doi: 10.1007/978-3-319-23219-5_21)

107619.pdf - Accepted Version



The subgraph isomorphism problem involves finding a pattern graph inside a target graph. We present a new bit- and thread-parallel constraint-based search algorithm for the problem, and experiment on a wide range of standard benchmark instances to demonstrate its effective- ness. We introduce supplemental graphs, to create implied constraints. We use a new low-overhead, lazy variation of con ict directed backjump- ing which interacts safely with parallel search, and a counting-based all-different propagator which is better suited for large domains.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Mccreesh, Dr Ciaran and Prosser, Dr Patrick
Authors: McCreesh, C., and Prosser, P.
College/School:College of Science and Engineering > School of Computing Science
Copyright Holders:Copyright © 2015 Springer International Publishing
First Published:First published in Lecture Notes in Computer Science 9255:295-312
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher.
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
608951Engineering and Physical Sciences Doctoral Training Grant 2012-16Mary Beth KneafseyEngineering & Physical Sciences Research Council (EPSRC)EP/K503058/1VICE PRINCIPAL RESEARCH & ENTERPRISE