✦ LIBER ✦

Parallelism and the maximal path problem

✍ Scribed by Richard Anderson; Ernst W. Mayr

Book ID: 113163030
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 438 KB
Volume: 24
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90105-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel algorithm for the maximal pat

A parallel algorithm for the maximal path problem

✍ Richard Anderson 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 708 KB

Parallelism and path-spaces

✍ D. D. Kosambi 📂 Article 📅 1933 🏛 Springer-Verlag 🌐 French ⚖ 590 KB

Parallel complexity of computing a maxim

Parallel complexity of computing a maximal set of disjoint paths

✍ Alok Aggarwal 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Parallel Algorithms for Dynamic Shortest

Parallel Algorithms for Dynamic Shortest Path Problems

✍ Ismail Chabini; Sridevi Ganugapati 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB

Path relinking approach for multiple all

Path relinking approach for multiple allocation hub maximal covering problem

✍ Bo Qu; Kerui Weng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 313 KB

We consider the multiple allocation hub maximal covering problem (MAHMCP): Considering a serviced O-D flow was required to reach the destination optionally passing through one or two hubs in a limited time, cost or distance, what is the optimal way to locate p hubs to maximize the serviced flows? By

Parallelism and the feedback vertex set

Parallelism and the feedback vertex set problem

✍ Daniele P. Bovet; S. De Agostino; R. Petreschi 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 533 KB