An efficient parallel algorithm for the longest path problem in meshes

Details An efficient parallel algorithm for the longest path problem in meshes An efficient parallel algorithm for the longest path problem in meshes

2012-01-21

arxiv.org/abs/1201.4459v1

Computer Science

Data Structures and Algorithms

23page, 16 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An efficient parallel algorithm for the longest path problem in meshes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An efficient parallel algorithm for the longest path problem in meshes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An efficient parallel algorithm for the longest path problem in meshes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-134884