An improvement on parallel computation of a maximal matching
From MaRDI portal
Publication:672837
DOI10.1016/0020-0190(95)00166-2zbMath0875.68464MaRDI QIDQ672837
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00166-2
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
An efficient parallel graph edge matching algorithm and its applications, An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs, Efficient parallel algorithms for parameterized problems
Cites Work