An improvement on parallel computation of a maximal matching

DOI10.1016/0020-0190(95)00166-2zbMath0875.68464OpenAlexW1987734035MaRDI QIDQ672837

Yijie Han

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00166-2

zbMATH Keywords

Parallel algorithmsGraph algorithmsMaximal matchingOptimal algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (3)

Efficient parallel algorithms for parameterized problems ⋮ An efficient parallel graph edge matching algorithm and its applications ⋮ An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs

Cites Work

• Unnamed Item
• An improved parallel algorithm for maximal matching
• A fast and simple randomized parallel algorithm for maximal matching
• Removing randomness in parallel computation without a processor penalty
• An optimal parallel algorithm for maximal matching

This page was built for publication: An improvement on parallel computation of a maximal matching