@article {IOPORT.06015801,
    author       = {Keshavarz-Kohjerdi, Fatemeh and Bagheri, Alireza and Asgharian-Sardroud, Asghar},
    title        = {A linear-time algorithm for the longest path problem in rectangular grid graphs.},
    year         = {2012},
    journal      = {Discrete Applied Mathematics},
    volume       = {160},
    number       = {3},
    issn         = {0166-218X},
    pages        = {210-217},
    publisher    = {Elsevier Science B.V. (North-Holland), Amsterdam},
    doi          = {10.1016/j.dam.2011.08.010},
    abstract     = {Summary: 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. In this paper, we give a linear-time algorithm for finding a longest path between any two given vertices in a rectangular grid graph.},
    identifier   = {06015801},
}