Abstract
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.
Funder
Conselho Nacional de Desenvolvimento Científico e Tecnológico
FAPERJ
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Reference20 articles.
1. Ahuja R.K., Magnanti T.L. and Orlin J.B., Network flows. Elsevier (1988).
2. Long induced paths and cycles in Kneser graphs
3. Emergence of Scaling in Random Networks
4. Bergougnoux B. and Kanté M.M., A meta-algorithm for solving connectivity and acyclicity constraints on locally checkable properties parameterized by graph width measures. Preprint arXiv:1805.11275 (2018).
5. Bökler F., Chimani M., Wagner M.H. and Wiedera T., An experimental study of ILP formulations for the longest induced path problem. In Combinatorial Optimization, edited by Baïou M., Gendron B., Günlük O. and Mahjoub A.R.. In Vol. 12176 of Lecture Notes in Computer Science. Springer, Cham (2020).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献