Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 
n) Worst Case Update Time

Bhattacharya, Sayan; Henzinger, Monika; Nanongkai, Danupon

doi:10.1137/1.9781611974782

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bhattacharya, S., Henzinger, M., & Nanongkai, D. (2017). Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time. In P. N. Klein (Ed.), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 470-489). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974782.

Cite as: https://hdl.handle.net/21.11116/0000-000E-7251-6

Abstract

There is no abstract available