A simple randomized parallel algorithm for maximal f-matchings
From MaRDI portal
Publication:672735
DOI10.1016/0020-0190(95)00179-4zbMath1022.68738OpenAlexW2077159459MaRDI QIDQ672735
Stefan Jarominek, Oscar Garrido, 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
Cites Work
- Unnamed Item
- Unnamed Item
- A guided tour of Chernoff bounds
- An improved parallel algorithm for maximal matching
- A fast and simple randomized 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