✦ LIBER ✦

An improved parallel algorithm for maximal matching

✍ Scribed by Amos Israeli; Y. Shiloach

Book ID: 113162966
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 291 KB
Volume: 22
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(86)90141-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal parallel algorithm for maxima

An optimal parallel algorithm for maximal matching

✍ Pierre Kelsen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 544 KB

An improvement on parallel computation o

An improvement on parallel computation of a maximal matching

✍ Yijie Han 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 481 KB

A fast and simple randomized parallel al

A fast and simple randomized parallel algorithm for maximal matching

✍ Amos Israeli; A. Itai 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 330 KB

A simple randomized parallel algorithm f

A simple randomized parallel algorithm for maximal ƒ-matchings

✍ Oscar Garrido; Stefan Jarominek; Andrzej Lingas; Wojciech Rytter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 449 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 improved algorithm for matching biolo

An improved algorithm for matching biological sequences

✍ Osamu Gotoh 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 233 KB