The longest path problem is a generalization of the well known Hamiltonian path problem. It has been shown that the longest path problem is NP-complete. Many researchers try to solve it on some special classes of graphs. Another practical generalization is given two vertices and tries to find a longest path between these two vertices. It is called the end-to-end longest path problem. In this paper, we consider this general problem on a mesh. We generalize a previous work to solve the problem on meshes with one missing vertex in linear time. Further research opportunities and improvements are also suggested.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com