An Experimental Study of ILP Formulations for the Longest Induced Path Problem

Fritz Bökler, Markus Chimani, Mirko H. Wagner +1

Given a graph $G=(V,E)$, the longest induced path problem asks for a maximum cardinality node subset $W\subseteq V$ such that the graph induced by $W$ is a path. It is a long estab…