Pages that link to "Item:Q5494978"
From MaRDI portal
The following pages link to Fully Dynamic Maximal Matching in O (log n) Update Time (Q5494978):
Displaying 15 items.
- Dynamic algorithms via the primal-dual method (Q1640995) (← links)
- Shortest augmenting paths for online matchings on trees (Q1743118) (← links)
- Deterministic dynamic matching in \(O(1)\) update time (Q2300734) (← links)
- Fully Dynamic Matching in Bipartite Graphs (Q3448782) (← links)
- Design of Dynamic Algorithms via Primal-Dual Method (Q3448786) (← links)
- Maintaining Near-Popular Matchings (Q3449500) (← links)
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (Q4571920) (← links)
- (Q4638113) (← links)
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
- (Q5002673) (← links)
- (Q5002703) (← links)
- Improved algorithm for dynamic b-Matching (Q5111701) (← links)
- (Q5116480) (← links)
- (Q5743402) (← links)
- Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)
