๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An optimal parallel connectivity algorithm

โœ Scribed by Uzi Vishkin

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
707 KB
Volume
9
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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
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