Pages that link to "Item:Q672837"
From MaRDI portal
The following pages link to An improvement on parallel computation of a maximal matching (Q672837):
Displaying 10 items.
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
- An improved parallel algorithm for maximal matching (Q1073571) (← links)
- A fast and simple randomized parallel algorithm for maximal matching (Q1073573) (← links)
- Improved processor bounds for combinatorial problems in RNC (Q1262128) (← links)
- An efficient parallel graph edge matching algorithm and its applications (Q1288436) (← 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)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- A Local Computation Approximation Scheme to Maximum Matching (Q2851862) (← links)