Fully Dynamic Maximum Matching and Vertex Cover in O(log^3 n) Worst Case Update Time

Fully Dynamic Maximum Matching and Vertex Cover in O(log^3 n) Worst Case Update Time

Authors
  • Bhattacharya, Sayan
  • Henzinger, Monika
  • Nanongkai, Danupon
Grafik Top
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms 2017
Divisions
Theory and Applications of Algorithms
Subjects
Theoretische Informatik
Event Location
Barcelona, Spain
Event Type
Conference
Event Dates
January 16-19, 2017
Date
January 2017
Export
Grafik Top