A linear-time algorithm for the longest path problem in rectangular grid graphs
Under an Elsevier user license
open archive
Highlights
► The longest path problem is a well-known NP-hard problem and so far it has been solved polynomially only for a few classes of graphs. ► We give a linear-time algorithm for finding a longest path between any two given vertices in a rectangular grid graph. ► It is shown that any longest path between any two vertices of a rectangular grid graph excludes at most two vertices of the graph.
Keywords
Hamiltonian path
Hamiltonian cycle
Grid graph
Longest path
Rectangular grid graph
Cited by (0)
Copyright © 2011 Elsevier B.V.