A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH

DOI10.1080/10637199508915482MaRDI QIDQ4820076zbMATH OpenOpenAlexFDO

Authors Alak Kumar Datta, Ranjan Kumar Sen

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)

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• An improved parallel algorithm for maximal matching
• Parallel Symmetry-Breaking in Sparse Graphs
• Planar Depth-First Search in $O(\log n)$ Parallel Time

Cited in

(1)

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

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

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