Heuristics and Really Hard Instances for Subgraph Isomorphism Problems

McCreesh, C., Prosser, P. and Trimble, J. (2016) Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. In: 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New York, NY, USA, 9-15 July 2016, pp. 631-638. ISBN 9781577357704

[img] Text
119086.pdf - Accepted Version
Restricted to Repository staff only


Publisher's URL: http://www.ijcai.org/Proceedings/16/Papers/096.pdf


We show how to generate “really hard” random instances for subgraph isomorphism problems. For the non-induced variant, we predict and observe a phase transition between satisfiable and unsatis- fiable instances, with a corresponding complexity peak seen in three different solvers. For the induced variant, much richer behaviour is observed, and constrainedness gives a better measure of difficulty than does proximity to a phase transition. We also discuss variable and value ordering heuristics, and their relationship to the expected number of solutions.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Trimble, Mr James and Mccreesh, Dr Ciaran and Prosser, Dr Patrick
Authors: McCreesh, C., Prosser, P., and Trimble, J.
College/School:College of Science and Engineering > School of Computing Science
Related URLs:

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