✦ LIBER ✦

Efficient parallel algorithms for some graph theory problems

✍ Scribed by Jun Ma; Shaohan Ma

Book ID: 112945695
Publisher: Springer
Year: 1993
Tongue: English
Weight: 292 KB
Volume: 8
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02939544

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Work-efficient BSR-based parallel algori

Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory

✍ Jean-Frédéric Myoupo; David Semé 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 361 KB

Space efficient algorithms for some grap

Space efficient algorithms for some graph theoretical problems

✍ Joseph Ja'Ja'; Janos Simon 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 621 KB

Parallel updating algorithms for graph s

Parallel updating algorithms for graph searching problems

✍ Pranay Chaudhuri 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 776 KB

Efficient Parallel Algorithms for Parabo

Efficient Parallel Algorithms for Parabolic Problems

✍ Du, Q.; Mu, M.; Wu, Z. N. 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 200 KB

Efficient Parallel Algorithms for Permut

Efficient Parallel Algorithms for Permutation Graphs

✍ K. Arvind; V. Kamakoti; C.P. Rangan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 641 KB

In this paper, we present optimal \(O(\log n)\) time, \(O(n / \log n)\) processor EREW PRAM parallel algorithms for finding the connected components, cut vertices, and bridges of a permutation graph. We also present an \(O(\log n)\) time, \(O(n)\) processor, CREW PRAM model parallel algorithm for fi

Algorithms for some graph theoretical op

Algorithms for some graph theoretical optimization problems

✍ Linda S. Moonen 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 50 KB