✦ LIBER ✦

Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two1

✍ Scribed by H. L. Bodlaender and B. van Antwerpen - de Fluiter

Book ID: 120137142
Publisher: Springer
Year: 2001
Tongue: English
Weight: 397 KB
Volume: 29
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s004530010070

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On greedy algorithms for series parallel

On greedy algorithms for series parallel graphs

✍ Alan J. Hoffman 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 304 KB

Parallel algorithms for permutation grap

Parallel algorithms for permutation graphs

✍ Chang-Wu Yu; Gen-Huey Chen 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 365 KB

Parallel algorithms for parity graphs

✍ T Przytycka; D.G Corneil 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 782 KB

Efficient Parallel Algorithms for Planar

Efficient Parallel Algorithms for Planarst-Graphs

✍ Mikhail J. Atallah, Danny Z. Chen and Ovidiu Daescu 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 136 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

Parallel Algorithms for Reducible Flow G

Parallel Algorithms for Reducible Flow Graphs

✍ Vijaya Ramachandran 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 324 KB

We present parallel NC algorithms for recognizing a reducible flow graph rfg and for finding dominators, minimum feedback vertex sets, and a depth first search Ž . tree in an rfg. On an n-node rfg, all of these algorithms run in polylog n time Ž . Ž . using M n processors, where M n is the number o