scientific article; zbMATH DE number 1471955
From MaRDI portal
Publication:4489037
Recommendations
- An optimal parallel algorithm for maximal matching
- Finding maximum matching for bipartite graphs in parallel
- An efficient parallel graph edge matching algorithm and its applications
- An improved parallel algorithm for maximal matching
- o(log4 n) time parallel maximal matching algorithm using linear number of processors
Cited in
(19)- An improved parallel algorithm for maximal matching
- A fast and simple randomized parallel algorithm for maximal matching
- A parallel algorithm for the maximal path problem
- A parallel algorithm for the maximum 2-chain edge packing problem
- Improved processor bounds for combinatorial problems in RNC
- An efficient parallel algorithm for maximum matching for some classes of graphs
- An efficient parallel graph edge matching algorithm and its applications
- An optimal parallel algorithm for maximal matching
- Finding maximum matching for bipartite graphs in parallel
- A fast and efficient NC algorithm for maximal matching
- 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
- scientific article; zbMATH DE number 4160789 (Why is no real title available?)
- IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH
- o(log4 n) time parallel maximal matching algorithm using linear number of processors
- Parallel maximum matching algorithms in interval graphs
- scientific article; zbMATH DE number 975369 (Why is no real title available?)
- An improvement on parallel computation of a maximal matching
- A parallel algorithm for eliminating cycles in undirected graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489037)
