Portfolios of Subgraph Isomorphism Algorithms - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Portfolios of Subgraph Isomorphism Algorithms


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.
Fichier principal
Vignette du fichier
paper.pdf (602.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01301829 , version 1 (13-04-2016)


  • HAL Id : hal-01301829 , version 1


Lars Kotthoff, Ciaran Mccreesh, Christine Solnon. Portfolios of Subgraph Isomorphism Algorithms. 10th International Conference on Learning and Intelligent OptimizatioN Conference (LION), May 2016, Ischia Island (Naples), Italy. pp.107-122. ⟨hal-01301829⟩
250 View
528 Download


Gmail Facebook Twitter LinkedIn More