Pages that link to "Item:Q1887042"
From MaRDI portal
The following pages link to Distributed algorithm for approximating the maximum matching (Q1887042):
Displaying 5 items.
- A two-stage hardware scheduler combining greedy and optimal scheduling (Q436901) (← links)
- Why locally-fair maximal flows in client-server networks perform well (Q652641) (← links)
- Distributed algorithms for weighted problems in sparse graphs (Q866546) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well (Q5323085) (← links)
