𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An optimal parallel algorithm for maximal matching

✍ Scribed by Pierre Kelsen

Book ID
107766239
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
544 KB
Volume
52
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 Simple Parallel Algorithm for
An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs
✍ Shan-Chyun Ku; Biing-Feng Wang πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 91 KB

An outerplanar graph is a planar graph that can be imbedded in the plane in such a way that all vertices lie on the exterior face. An outerplanar graph is maximal if no edge can be added to the graph without violating the outerplanarity. In this paper, an optimal parallel algorithm is proposed on th