Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time

Abstract

The longest path and Hamiltonian problems were known to be NP-complete. In spite of many applications of these problems, their complexities are still unknown for many classes of graphs, including supergrid graphs with holes and solid supergrid graphs. In this paper, we will study the complexity of the longest (s, t)-path problem on O-shaped supergrid graphs. The longest (s, t)-path is a simple path from s to t with the largest number of visited vertices. An O-shaped supergrid graph is a rectangular supergrid graph with one rectangular hollow. We will propose a linear-time algorithm to find the longest (s, t)-path of O-shaped supergrid graphs. The longest (s, t)-paths of O-shaped supergrid graphs can be used to compute the smallest stitching path of computerized embroidery machine and 3D printer when a hollow object is printed.