Pages that link to "Item:Q4286119"
From MaRDI portal
The following pages link to PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS (Q4286119):
Displaying 4 items.
- A note on parallel complexity of maximum \(f\)-matching (Q293199) (← links)
- A simple randomized parallel algorithm for maximal f-matchings (Q672735) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
- On parallel complexity of maximum f-matching and the degree sequence problem (Q5096889) (← links)
