SODA 2017
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O (log 3 n ) Worst Case Update Time
Abstract
No abstract is available in the live database for this paper.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- ACM-SIAM Symposium on Discrete Algorithms
- Archive span
- 1990-2025
- Indexed papers
- 4674
- Paper id
- 1851983517036979