A Partitioning Algorithm for Maximum Common Subgraph Problems

McCreesh, C. , Prosser, P. and Trimble, J. (2017) A Partitioning Algorithm for Maximum Common Subgraph Problems. In: 26th International Joint Conference on Artificial Intelligence (IJCAI'17), Melbourne, Australia, 19-25 Aug 2017, pp. 712-719. (doi:10.24963/ijcai.2017/99)

[img]
Preview
Text
142034.pdf - Accepted Version

372kB

Abstract

We introduce a new branch and bound algorithm for the maximum common subgraph and maximum common connected subgraph problems which is based around vertex labelling and partitioning. Our method in some ways resembles a traditional constraint programming approach, but uses a novel compact domain store and supporting inference algorithms which dramatically reduce the memory and computation requirements during search, and allow better dual viewpoint ordering heuristics to be calculated cheaply. Experiments show a speedup of more than an order of magnitude over the state of the art, and demonstrate that we can operate on much larger graphs without running out of memory.

Item Type:Conference Proceedings
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Trimble, Mr James and Prosser, Dr Patrick and Mccreesh, Dr Ciaran
Authors: McCreesh, C., Prosser, P., and Trimble, J.
College/School:College of Science and Engineering > School of Computing Science
Copyright Holders:Copyright © 2017 The Authors
First Published:First published in 26th International Joint Conference on Artificial Intelligence (IJCAI'17): 712-719
Publisher Policy:Reproduced in accordance with the publisher copyright policy
Related URLs:

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