An efficient parallel algorithm for maximum matching for some classes of graphs

DOI10.1006/JPDC.1998.1470zbMath0936.68126OpenAlexW2020534505MaRDI QIDQ1268785

I. I. Parfenov

Publication date: 1998

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1998.1470

zbMATH Keywords

modular decompositionmatching parallel algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

This page was built for publication: An efficient parallel algorithm for maximum matching for some classes of graphs