The Longest (s, t)-Path Problem on O-Shaped Supergrid Graphs

The longest (s,t)-path problem on supergrid graphs is known to be NP-complete.However, the complexity of this problem on supergrid graphs with or without holes is still unknown.In the past, we presented linear-time algorithms for solving the longest (s,t)-path problem on L-shaped and Wax C-shaped supergrid graphs, which form subclasses of supergrid

read more