Parallel computation of matchings in trees
From MaRDI portal
Publication:1179213
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)
Related Items
AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗, THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗†