Pages that link to "Item:Q1261482"
From MaRDI portal
The following pages link to Approximating matchings in parallel (Q1261482):
Displaying 19 items.
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- Approximating weighted matchings in parallel (Q845697) (← links)
- Parallel computation of matchings in trees (Q1179213) (← links)
- Improved processor bounds for combinatorial problems in RNC (Q1262128) (← links)
- Finding maximum matching for bipartite graphs in parallel (Q1342094) (← links)
- Almost fully-parallel parentheses matching (Q1345960) (← links)
- Distributed algorithm for approximating the maximum matching (Q1887042) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
- Processor efficient parallel matching (Q2471700) (← links)
- A Local Computation Approximation Scheme to Maximum Matching (Q2851862) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)
- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609) (← links)
- (Q3128895) (← links)
- (Q4287356) (← links)
- (Q4536416) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Towards more precise parallel biconnectivity approximation (Q6487442) (← links)
- Distributed maximum matching verification in CONGEST (Q6535036) (← links)