An optimal parallel algorithm for maximal matching
From MaRDI portal
Recommendations
- An improved parallel algorithm for maximal matching
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs
- scientific article; zbMATH DE number 1471955
- An improvement on parallel computation of a maximal matching
- o(log4 n) time parallel maximal matching algorithm using linear number of processors
Cites work
- A fast and simple randomized parallel algorithm for maximal matching
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- An improved parallel algorithm for maximal matching
- Constructing a Maximal Independent Set in Parallel
- Deterministic coin tossing with applications to optimal parallel list ranking
- scientific article; zbMATH DE number 4064468 (Why is no real title available?)
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
Cited in
(39)- An adjustable linear time parallel algorithm for maximum weight bipartite matching
- An improved parallel algorithm for maximal matching
- A fast and simple randomized parallel algorithm for maximal matching
- Minimum-maximal matching in series-parallel graphs
- The general maximum matching algorithm of Micali and Vazirani
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs
- A parallel algorithm for the maximum 2-chain edge packing problem
- Approximating matchings in parallel
- An efficient parallel graph edge matching algorithm and its applications
- An optimal parallel matching algorithm for cographs
- 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
- Parallel algorithms for maximum matching in complements of interval graphs and related problems
- Approximation algorithms for Max Morse matching
- A 2-approximation NC algorithm for connected vertex cover and tree cover
- Processor efficient parallel matching
- Parallel graduated assignment algorithm for multiple graph matching based on a common labelling
- OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS
- scientific article; zbMATH DE number 4215388 (Why is no real title available?)
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem
- scientific article; zbMATH DE number 4155887 (Why is no real title available?)
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
- Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets
- Sublinear-Time Parallel Algorithms for Matching and Related Problems
- The Maximum Partition Matching Problem with Applications
- PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS
- IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH
- scientific article; zbMATH DE number 1471955 (Why is no real title available?)
- On efficient implicit OBDD-based algorithms for maximal matchings
- o(log4 n) time parallel maximal matching algorithm using linear number of processors
- A fast dynamic optimum algorithm for maximum matching in bipartite graphs
- Parallel maximum matching algorithms in interval graphs
- Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model
- Distributed algorithms for covering, packing and maximum weighted matching
- A simple randomized parallel algorithm for maximal f-matchings
- An improvement on parallel computation of a maximal matching
- Parallel algorithms for bipartite matching problems on distributed memory computers
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
This page was built for publication: An optimal parallel algorithm for maximal matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1341686)
