Parallel computation of matchings in trees

DOI10.1016/S0167-8191(05)80054-7zbMath0736.68065MaRDI QIDQ1179213

Selim G. Akl, Constantine N. K. Osiakwan

Publication date: 26 June 1992

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

EREW PRAMmaximum weight \(b\)-matchingmaximum cardinality \(b\)-matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ ⋮ THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗†

This page was built for publication: Parallel computation of matchings in trees