IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH
From MaRDI portal
Publication:4485123
DOI10.1080/10637199808947393zbMath0956.68161WikidataQ126251894 ScholiaQ126251894MaRDI QIDQ4485123
Alak Kumar Datta, Ranjan Kumar Sen
Publication date: 12 March 2001
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637199808947393
68W10: Parallel algorithms in computer science
Related Items
Cites Work
- An improved parallel algorithm for maximal matching
- Planar Depth-First Search in $O(\log n)$ Parallel Time
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast parallel algorithm for the maximal independent set problem
- A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH