An efficient parallel algorithm for the longest path problem in meshes
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
TL;DR
This paper introduces a linear-time sequential algorithm for the longest path problem in meshes and extends it to a constant-time parallel algorithm suitable for any parallel machine, significantly improving computational efficiency.
Contribution
It presents the first linear-time sequential algorithm and a constant-time parallel algorithm for the longest path problem in meshes, advancing computational methods in graph theory.
Findings
Sequential algorithm runs in linear time.
Parallel algorithm operates in constant time.
Applicable to all parallel machine architectures.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Computational Geometry and Mesh Generation