Pages that link to "Item:Q2875173"
From MaRDI portal
The following pages link to Maintaining a large matching and a small vertex cover (Q2875173):
Displaying 20 items.
- Dynamic algorithms via the primal-dual method (Q1640995) (← links)
- Approximating dynamic weighted vertex cover with soft capacities (Q2072101) (← links)
- Deterministic dynamic matching in \(O(1)\) update time (Q2300734) (← links)
- Dynamic rank-maximal and popular matchings (Q2420654) (← 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)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) (Q4641588) (← links)
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
- (Q5002673) (← links)
- (Q5002703) (← links)
- (Q5009521) (← links)
- Improved algorithm for dynamic b-Matching (Q5111701) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Q5252659) (← 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)