Pages that link to "Item:Q1341686"
From MaRDI portal
The following pages link to An optimal parallel algorithm for maximal matching (Q1341686):
Displaying 30 items.
- A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
- On efficient implicit OBDD-based algorithms for maximal matchings (Q476163) (← links)
- Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model (Q582123) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- A simple randomized parallel algorithm for maximal f-matchings (Q672735) (← links)
- An improvement on parallel computation of a maximal matching (Q672837) (← links)
- Parallel algorithms for bipartite matching problems on distributed memory computers (Q712711) (← links)
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) (Q751274) (← links)
- An adjustable linear time parallel algorithm for maximum weight bipartite matching (Q1045931) (← links)
- An improved parallel algorithm for maximal matching (Q1073571) (← links)
- A fast and simple randomized parallel algorithm for maximal matching (Q1073573) (← links)
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- The general maximum matching algorithm of Micali and Vazirani (Q1105385) (← links)
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
- A parallel algorithm for the maximum 2-chain edge packing problem (Q1123636) (← links)
- Approximating matchings in parallel (Q1261482) (← links)
- An efficient parallel graph edge matching algorithm and its applications (Q1288436) (← links)
- An optimal parallel matching algorithm for cographs (Q1338271) (← links)
- Finding maximum matching for bipartite graphs in parallel (Q1342094) (← links)
- Parallel maximum independent set in convex bipartite graphs (Q1350905) (← links)
- A fast and efficient NC algorithm for maximal matching (Q1352118) (← links)
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053) (← links)
- Parallel algorithms for maximum matching in complements of interval graphs and related problems (Q1969958) (← links)
- Approximation algorithms for Max Morse matching (Q2362103) (← links)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
- Processor efficient parallel matching (Q2471700) (← links)
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems (Q3990106) (← links)
- Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets (Q4033763) (← links)
- Sublinear-Time Parallel Algorithms for Matching and Related Problems (Q4033764) (← links)