A simple randomized parallel algorithm for maximal f-matchings

DOI10.1016/0020-0190(95)00179-4zbMATH Open1022.68738OpenAlexW2077159459MaRDI QIDQ672735FDOQ672735

Authors: Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter 

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)00179-4

Recommendations

• A fast and simple randomized parallel algorithm for maximal matching
• Maximum matchings in general graphs through randomization
• scientific article; zbMATH DE number 1303560
• An optimal parallel algorithm for maximal matching

zbMATH Keywords

parallel algorithms\(f\)-matchings

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A guided tour of Chernoff bounds
• An improved parallel algorithm for maximal matching
• An optimal parallel algorithm for maximal matching
• Parallel Merge Sort
• PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS
• A fast and simple randomized parallel algorithm for maximal matching

Cited In (2)

• An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs
• Faster algorithm for finding maximum 1-restricted simple 2-matchings

This page was built for publication: A simple randomized parallel algorithm for maximal f-matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672735)