Portfolios of Subgraph Isomorphism Algorithms

Kotthoff, L., McCreesh, C. and Solnon, C. (2016) Portfolios of Subgraph Isomorphism Algorithms. In: Learning and Intelligent OptimizatioN Conference (LION 10), Napoli, Italy, 29 May - 1 June 2016, pp. 107-122. ISBN 9783319503486 (doi: 10.1007/978-3-319-50349-3_8)

Abstract

Subgraph isomorphism is a computationally challenging problem with important practical applications, for example in computer vision, biochemistry, and model checking. There are a number of state-of-the-art algorithms for solving the problem, each of which has its own performance characteristics. As with many other hard problems, the single best choice of algorithm overall is rarely the best algorithm on an instance-by-instance. We develop an algorithm selection approach which leverages novel features to characterise subgraph isomorphism problems and dynamically decides which algorithm to use on a per-instance basis. We demonstrate substantial performance improvements on a large set of hard benchmark problems. In addition, we show how algorithm selection models can be leveraged to gain new insights into what affects the performance of an algorithm.

• Item Type: Conference Proceedings
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Mccreesh, Dr Ciaran
• Authors: Kotthoff, L., McCreesh, C., and Solnon, C.
• College/School: College of Science and Engineering > School of Computing Science
• ISSN: 0302-9743
• ISBN: 9783319503486
• Published Online: 01 December 2016
• Copyright Holders: Copyright © 2016 Springer International Publishing AG
• First Published: First published in Lecture Notes in Computer Science 10079: 107-122
• Publisher Policy: Reproduced in accordance with the publisher copyright policy

Related URLs

• Organisation