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 4 items.
- 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 general maximal matchings is as easy as for bipartite graphs (Q1607053) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
