Pages that link to "Item:Q4575767"
From MaRDI portal
The following pages link to Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time (Q4575767):
Displaying 16 items.
- Approximating dynamic weighted vertex cover with soft capacities (Q2072101) (← links)
- Dynamic clustering to minimize the sum of radii (Q2205631) (← links)
- Deterministic dynamic matching in \(O(1)\) update time (Q2300734) (← links)
- Maximum matching on trees in the online preemptive and the incremental graph models (Q2329370) (← links)
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (Q4571920) (← links)
- (Q5002673) (← links)
- (Q5002703) (← links)
- (Q5009521) (← links)
- (Q5090980) (← links)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481) (← links)
- (Q5111737) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Dynamic Matching Algorithms in Practice (Q5874529) (← links)
- Deterministic dynamic matching in worst-case update time (Q6066769) (← links)
- Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. (Q6075891) (← links)
- Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)
