| Issue |
RAIRO-Oper. Res.
Volume 55, Number 2, March-April 2021
|
|
|---|---|---|
| Page(s) | 333 - 353 | |
| DOI | https://doi.org/10.1051/ro/2021004 | |
| Published online | 23 March 2021 | |
Exact and approximate algorithms for the longest induced path problem
Institute of Computing, Universidade Federal Fluminense, 24210-346 Niterói, RJ, Brazil
* Corresponding author: celso@ic.uff.br
Received:
16
October
2020
Accepted:
14
January
2021
The longest induced path problem consists in finding a maximum subset of vertices of a graph such that it induces a simple path. We propose a new exact enumerative algorithm that solves problems with up to 138 vertices and 493 edges and a heuristic for larger problems. Detailed computational experiments compare the results obtained by the new algorithms with other approaches in the literature and investigate the characteristics of the optimal solutions.
Mathematics Subject Classification: 05C30 / 05C38 / 05C85 / 68W25 / 90C27 / 90C35
Key words: Longest induced path problem / exact algorithm / backtracking / heuristics
© EDP Sciences, ROADEF, SMAI 2021
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.