Exact and approximate algorithms for the longest induced path problem

DOI10.1051/ro/2021004zbMath1468.05060OpenAlexW3125577014MaRDI QIDQ5003500

Ruslán G. Marzo, Celso Carneiro Ribeiro

Publication date: 22 July 2021

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2021004

zbMATH Keywords

heuristicsexact algorithmbacktrackinglongest induced path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Enumeration in graph theory (05C30) Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

New formulations and branch-and-cut procedures for the longest induced path problem ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Maximum weighted induced forests and trees: new formulations and a computational comparative review

This page was built for publication: Exact and approximate algorithms for the longest induced path problem