A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH

DOI10.1080/10637199508915482zbMath1049.68882OpenAlexW2004967569MaRDI QIDQ4820076

Ranjan Kumar Sen, Alak Kumar Datta

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199508915482

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH

Cites Work

• Unnamed Item
• 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
• Parallel Symmetry-Breaking in Sparse Graphs

This page was built for publication: A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH