arXiv Open Access 2012

An efficient parallel algorithm for the longest path problem in meshes

Fatemeh Keshavarz-Kohjerdi Alireza Bagheri

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DS

Penulis (2)

Fatemeh Keshavarz-Kohjerdi

Alireza Bagheri

Format Sitasi

APA MLA BibTeX

Keshavarz-Kohjerdi, F., Bagheri, A. (2012). An efficient parallel algorithm for the longest path problem in meshes. https://arxiv.org/abs/1201.4459

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2012
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓