A framework for dynamic matching in weighted graphs

DOI10.1145/3406325.3451113OpenAlexW3170971397MaRDI QIDQ6087035

Zachary Langley, Aditi Dudeja, Aaron Bernstein

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3406325.3451113

zbMATH Keywords

dynamic algorithmsdynamic matchingweighted matchingadaptive adversarymatching sparsifiers

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Deterministic dynamic matching in worst-case update time ⋮ Fast primal-dual update against local weight update in linear assignment problem and its application ⋮ Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model

This page was built for publication: A framework for dynamic matching in weighted graphs