ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time
Article URLs:
Alternative Article URLs:
Authors: Sayan Bhattacharya
  • Institute of Mathematical Sciences, Chennai
Monika Henzinger
  • University of Vienna, Faculty of Computer Science
Danupon Nanongkai
  • KTH Royal Institute of Technology
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/BhattacharyaHN17
Author Comments:

Discuss this paper and its artifacts below