An efficient parallel algorithm for the longest path problem in meshes
classification
💻 cs.DS
keywords
algorithmparallelproblemlongestmeshespathsequentialconsidered
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.