Pages that link to "Item:Q1103637"
From MaRDI portal
The following pages link to A Las Vegas RNC algorithm for maximum matching (Q1103637):
Displayed 13 items.
- A note on parallel complexity of maximum \(f\)-matching (Q293199) (← links)
- Independent sets versus perfect matchings (Q673116) (← links)
- Approximating weighted matchings in parallel (Q845697) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- Constructing a perfect matching is in random NC (Q1103639) (← links)
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs (Q1108036) (← links)
- Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (Q1183464) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM (Q1917253) (← links)
- Processor efficient parallel matching (Q2471700) (← links)
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS (Q3130161) (← links)
- NC Algorithms for Weighted Planar Perfect Matching and Related Problems (Q5002779) (← links)
- On parallel complexity of maximum f-matching and the degree sequence problem (Q5096889) (← links)