✦ LIBER ✦

Parallel algorithms for shortest path problems in polygons

✍ Scribed by Hossam ElGindy; Michael Goodrich

Publisher: Springer
Year: 1988
Tongue: English
Weight: 665 KB
Volume: 3
Category: Article
ISSN: 0178-2789
DOI: 10.1007/bf01901194

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for shortest path pr

Parallel algorithms for shortest path problems in polygons: The Visual Comput. Vol 3 No 6 (1988) pp 371–378

✍ H. ElGindy; M. Goodrich 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 110 KB

Parallel algorithms for the single sourc

Parallel algorithms for the single source shortest path problem

✍ P. Mateti; N. Deo 📂 Article 📅 1982 🏛 Springer Vienna 🌐 English ⚖ 880 KB

Termination Detection for Parallel Short

Termination Detection for Parallel Shortest Path Algorithms

✍ Michelle R Hribar; Valerie E Taylor; David E Boyce 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 322 KB

Shortest path computation is required by a large number of applications such as VLSI, transportation, and communication networks. These applications, which are often very complex and have sparse networks, generally use parallel labeling shortest path algorithms. Such algorithms, when implemented on

An addendum to parallel methods for visi

An addendum to parallel methods for visibility and shortest-path problems in simple polygons

✍ Michael T. Goodrich; Steven B. Shauck; Sumanta Guha 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 75 KB

A parallel shortest path algorithm

✍ Th. Mohr; C. Pasche 📂 Article 📅 1988 🏛 Springer Vienna 🌐 English ⚖ 565 KB

Shortest path algorithms for knapsack ty

Shortest path algorithms for knapsack type problems

✍ A. M. Frieze 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 484 KB