Pages that link to "Item:Q5002703"
From MaRDI portal
The following pages link to Fully dynamic almost-maximal matching: breaking the polynomial worst-case time barrier (Q5002703):
Displaying 6 items.
- Deterministic dynamic matching in \(O(1)\) update time (Q2300734) (← links)
- Simple Deterministic Algorithms for Fully Dynamic Maximal Matching (Q4962204) (← links)
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms (Q5002673) (← links)
- Dynamic Matching Algorithms in Practice (Q5874529) (← links)
- Deterministic dynamic matching in worst-case update time (Q6066769) (← links)
- Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)