Pages that link to "Item:Q1073571"
From MaRDI portal
The following pages link to An improved parallel algorithm for maximal matching (Q1073571):
Displaying 28 items.
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- Using maximal independent sets to solve problems in parallel (Q672378) (← links)
- A simple randomized parallel algorithm for maximal f-matchings (Q672735) (← links)
- An improvement on parallel computation of a maximal matching (Q672837) (← links)
- The maximal \(f\)-dependent set problem for planar graphs is in NC (Q673069) (← links)
- A fast and simple randomized parallel algorithm for maximal matching (Q1073573) (← links)
- Parallel circle-cover algorithms (Q1108792) (← links)
- A parallel algorithm for the maximum 2-chain edge packing problem (Q1123636) (← links)
- An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm (Q1124337) (← links)
- A randomized NC algorithm for the maximal tree cover problem (Q1183479) (← links)
- An efficient parallel graph edge matching algorithm and its applications (Q1288436) (← links)
- Removing randomness in parallel computation without a processor penalty (Q1309384) (← links)
- An optimal parallel algorithm for maximal matching (Q1341686) (← 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)
- Approximating unweighted connectivity problems in parallel (Q1854474) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Improved distributed degree splitting and edge coloring (Q2189174) (← links)
- Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs (Q2365177) (← links)
- On the Parameterized Parallel Complexity and the Vertex Cover Problem (Q2958339) (← links)
- IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH (Q4485123) (← links)
- (Q4536416) (← links)
- PARALLEL APPROXIMATE MATCHING (Q4819985) (← links)
- A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH (Q4820076) (← links)
- <i>o</i>(log<sup>4</sup> <i>n</i>) time parallel maximal matching algorithm using linear number of processors (Q4826117) (← links)
- Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Parallel algorithms on circular-arc graphs (Q5899761) (← links)
