✦ LIBER ✦

A parallel algorithm for nearly optimal edge search

✍ Scribed by Peter Damaschke

Book ID: 107766275
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 349 KB
Volume: 56
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00139-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel search algorithms in global opt

Parallel search algorithms in global optimization

✍ P.M. Pardalos 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 936 KB

A nearly optimal parallel algorithm for

A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon

✍ Piotr Berman; Andrzej Lingas 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 756 KB

We present a parallel algorithm for the Voronoi diagram of the set of vertices of a convex polygon. The algorithm runs in time O(logn) and uses O(n loglogn/log n) processors in the CRCW PRAM model. The concurrent write is used only by an integer sorting subroutine. We also obtain an O(log n)-time an

A parallel optimal routing algorithm

✍ Cassilda Ribeiro; Didier El Baz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 562 KB

A parallel search algorithm for directed

A parallel search algorithm for directed acyclic graphs

✍ Ratan K. Ghosh; G. P. Bhattacharjee 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 860 KB

Parallel algorithms for global optimizat

Parallel algorithms for global optimization

✍ L. C. W. Dixon; M. Jha 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 672 KB

A parallel algorithm for constrained opt

A parallel algorithm for constrained optimization problems

✍ Chen Zhong; Fei Pusheng 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 421 KB