✦ LIBER ✦

An optimal parallel algorithm for planar cycle separators

✍ Scribed by Ming-Yang Kao; Shang-Hua Teng; K. Toyama

Publisher: Springer
Year: 1995
Tongue: English
Weight: 622 KB
Volume: 14
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01192047

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal parallel algorithm for genera

An optimal parallel algorithm for generating combinations

✍ Selim G. Akl; David Gries; Ivan Stojmenovic 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 675 KB

An Optimal Parallel Matching Algorithm f

An Optimal Parallel Matching Algorithm for Cographs

✍ R. Lin; S. Olariu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 865 KB

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an \(n\)-v

An optimal parallel connectivity algorit

An optimal parallel connectivity algorithm

✍ Uzi Vishkin 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 707 KB

An optimal parallel algorithm for mergin

An optimal parallel algorithm for merging using multiselection

✍ Narsingh Deo; Amit Jain; Muralidhar Medidi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 654 KB

An optimal parallel algorithm for digita

An optimal parallel algorithm for digital curve segmentation

✍ Peter Damaschke 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 935 KB

First we give an optimal EREW PRAM algorithm that finds an unknown discrete monotone function f, with domain and range of size n, in O(log n) time using O(n) independent threshold queries of kind "f(x) > y?". Here "independent" means that simultaneous queries always refer to mutually disjoint values

An Optimal Parallel Co-Connectivity Algo

An Optimal Parallel Co-Connectivity Algorithm

✍ Ka Wong Chong; Stavros D. Nikolopoulos; Leonidas Palios 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 305 KB