On the Computational Complexity of Length- and Neighborhood-Constrained Path Problems

Max-Jonathan Luckow, Till Fluschnik

Finding paths in graphs is a fundamental graph-theoretic task. In this work, we we are concerned with finding a path with some constraints on its length and the number of vertices…