Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Bernstein, Aaron; van den Brand, Jan; Probst Gutenberg, Maximilian; Nanongkai, Danupon; Saranurak, Thatchaphol; Sidford, Aaron; Sun, He

doi:10.4230/LIPIcs.ICALP.2022.20

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

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

Bernstein, A., van den Brand, J., Probst Gutenberg, M., Nanongkai, D., Saranurak, T., Sidford, A., et al. (2022). Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. In M. Bojańczyk, E. Merelli, & D. P. Woodruff (Eds.), 49th EATCS International Conference on Automata, Languages, and Programming (pp. 1-20). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2022.20.

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

Abstract

There is no abstract available