Parallel computation of matchings in trees

DOI10.1016/S0167-8191(05)80054-7MaRDI QIDQ1179213zbMATH OpenFDO

Authors Constantine N. K. Osiakwan, Selim G. Akl

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)

Recommendations

• scientific article; zbMATH DE number 4155887
• Parallel algorithms for tree accumulations
• scientific article; zbMATH DE number 54593
• scientific article; zbMATH DE number 4041265
• Parallel algorithms for tree traversals
• Approximating matchings in parallel
• Parallel search algorithms for graphs and trees
• Parallel tree pattern matching

Cited in

(11)

• A matching algorithm in PMWL based on CluTree
• Parallel matrix product algorithm in the de Bruijn network using emulation of meshes of trees
• scientific article; zbMATH DE number 4155887 (Why is no real title available?)
• Parallelizing computation of expected values in recombinant binomial trees
• Fast parallel reordering and isomorphism testing of \(k\)-trees
• Optimal parallel algorithms for forest and term matching
• Binary tree algebraic computation and parallel algorithms for simple graphs
• An efficient algorithm for some tree matching problems
• AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
• THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗†
• Parallel tree pattern matching

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

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