The following pages link to Oscar Garrido (Q293197):
Displaying 5 items.
- A note on parallel complexity of maximum \(f\)-matching (Q293199) (← links)
- A simple randomized parallel algorithm for maximal f-matchings (Q672735) (← links)
- A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189) (← links)
- PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS (Q4286119) (← links)
- On parallel complexity of maximum f-matching and the degree sequence problem (Q5096889) (← links)
