The NP-Completeness of the N-Vehicle Exploration Problem

NVEP is NP-complete due to its reduction from the Hamiltonian path problem.