Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An experimental evaluation of refinement techniques for the subgraph isomorphism backtracking algorithms

An experimental evaluation of refinement techniques for the subgraph isomorphism backtracking... AbstractIn this paper, we study a well-known computationally hard problem, called the subgraph isomorphism problem where the goal is for a given pattern and target graphs to determine whether the pattern is a subgraph of the target graph. Numerous algorithms for solving the problem exist in the literature and most of them are based on the backtracking approach. Since straightforward backtracking is usually slow, many algorithmic refinement techniques are used in practical algorithms. The main goal of this paper is to study such refinement techniques and to determine their ability to speed up backtracking algorithms. To do this we use a methodology of experimental algorithmics. We perform an experimental evaluation of the techniques and their combinations and, hence, demonstrate their usefulness in practice. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Open Computer Science de Gruyter

An experimental evaluation of refinement techniques for the subgraph isomorphism backtracking algorithms

Mihelič, Jurij; Čibej, Uroš
Open Computer Science , Volume 11 (1): 10 – Jan 1, 2021
Download PDF
10 pages

Loading next page...
 
/lp/de-gruyter/an-experimental-evaluation-of-refinement-techniques-for-the-subgraph-VySlUOfIBS

References (29)

Publisher
de Gruyter
Copyright
© 2021 Jurij Mihelič et al., published by De Gruyter
eISSN
2299-1093
DOI
10.1515/comp-2020-0149
Publisher site
See Article on Publisher Site

Abstract

AbstractIn this paper, we study a well-known computationally hard problem, called the subgraph isomorphism problem where the goal is for a given pattern and target graphs to determine whether the pattern is a subgraph of the target graph. Numerous algorithms for solving the problem exist in the literature and most of them are based on the backtracking approach. Since straightforward backtracking is usually slow, many algorithmic refinement techniques are used in practical algorithms. The main goal of this paper is to study such refinement techniques and to determine their ability to speed up backtracking algorithms. To do this we use a methodology of experimental algorithmics. We perform an experimental evaluation of the techniques and their combinations and, hence, demonstrate their usefulness in practice.

Journal

Open Computer Science – de Gruyter

Published: Jan 1, 2021

Keywords: graph; subgraph isomorphism; backtracking; algorithm; experimental algorithmics

There are no references for this article.