![](/img/cover-not-exists.png)
[Society for Industrial and Applied Mathematics Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms - ()] Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms - Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O (log 3n ) Worst Case Update Time
Bhattacharya, Sayan, Henzinger, Monika, Nanongkai, DanuponLanguage:
english
DOI:
10.1137/1.9781611974782.30
File:
PDF, 609 KB
english