Pages that link to "Item:Q5362993"

The following pages link to Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (Q5362993):

Displaying 20 items.

• Dynamic algorithms via the primal-dual method (Q1640995) (← links)
• Approximating dynamic weighted vertex cover with soft capacities (Q2072101) (← links)
• Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
• Dynamic clustering to minimize the sum of radii (Q2205631) (← 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)
• (Q4638113) (← links)
• Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
• Density Independent Algorithms for Sparsifying k-Step Random Walks (Q5002617) (← links)
• (Q5002673) (← links)
• (Q5002703) (← links)
• (Q5009521) (← links)
• (Q5090980) (← links)
• Improved algorithm for dynamic b-Matching (Q5111701) (← links)
• (Q5111737) (← links)
• Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
• Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)