An improvement on parallel computation of a maximal matching
From MaRDI portal
(Redirected from Publication:672837)
Recommendations
Cites work
- scientific article; zbMATH DE number 177547 (Why is no real title available?)
- A fast and simple randomized parallel algorithm for maximal matching
- An improved parallel algorithm for maximal matching
- An optimal parallel algorithm for maximal matching
- Removing randomness in parallel computation without a processor penalty
Cited in
(11)- A Local Computation Approximation Scheme to Maximum Matching
- An improved parallel algorithm for maximal matching
- A fast and simple randomized parallel algorithm for maximal matching
- Efficient parallel algorithms for parameterized problems
- A fast and efficient NC algorithm for maximal matching
- Improved processor bounds for combinatorial problems in RNC
- o(log4 n) time parallel maximal matching algorithm using linear number of processors
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem
- An efficient parallel graph edge matching algorithm and its applications
- An optimal parallel algorithm for maximal matching
This page was built for publication: An improvement on parallel computation of a maximal matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672837)