An efficient parallel algorithm for the longest path problem in meshes
Data Structures and Algorithms
2012-01-24 v1
Abstract
In this paper, first we give a sequential linear-time algorithm for the longest path problem in meshes. This algorithm can be considered as an improvement of [13]. Then based on this sequential algorithm, we present a constant-time parallel algorithm for the problem which can be run on every parallel machine.
Cite
@article{arxiv.1201.4459,
title = {An efficient parallel algorithm for the longest path problem in meshes},
author = {Fatemeh Keshavarz-Kohjerdi and Alireza Bagheri},
journal= {arXiv preprint arXiv:1201.4459},
year = {2012}
}
Comments
23page, 16 figures