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

DOI10.1080/10637199808947393MaRDI QIDQ4485123zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

depth first search tree

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• An improvement on parallel computation of a maximal matching
• An improved parallel algorithm for maximal matching
• An optimal parallel algorithm for maximal matching
• scientific article; zbMATH DE number 1471955

Cites work

• A fast parallel algorithm for the maximal independent set problem
• A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• An improved parallel algorithm for maximal matching
• Planar Depth-First Search in O(\log n) Parallel Time

Cited in

(1)

• Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation

This page was built for publication: IMPROVED 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 Q4485123)