Streaming maximal matching with bounded deletions
From MaRDI portal
Cites work
- A Framework for Adversarially Robust Streaming Algorithms
- A simple augmentation method for matchings with applications to streaming algorithms
- Adversarially robust streaming algorithms via differential privacy
- An auction algorithm for bipartite matching in streaming and massively parallel computation models
- Automata, Languages and Programming
- Constructing large matchings via query access to a maximal matching oracle
- scientific article; zbMATH DE number 1256715 (Why is no real title available?)
- scientific article; zbMATH DE number 1424324 (Why is no real title available?)
- scientific article; zbMATH DE number 6789285 (Why is no real title available?)
- scientific article; zbMATH DE number 7053292 (Why is no real title available?)
- scientific article; zbMATH DE number 7768364 (Why is no real title available?)
- scientific article; zbMATH DE number 7829241 (Why is no real title available?)
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
- Maximum matching in turnstile streams
- Maximum matching via maximal matching queries
- Maximum matchings in dynamic graph streams and the simultaneous communication model
- Optimal lower bounds for matching and vertex cover in dynamic graph streams
- Separations and equivalences between turnstile streaming and linear sketching
- Sketching approximability of all finite CSPs
- Streaming and communication complexity of clique approximation
- The coin problem with applications to data streams
- The sparse awakens: streaming algorithms for matching size estimation in sparse graphs
- Turnstile streaming algorithms might as well be linear sketches
This page was built for publication: Streaming maximal matching with bounded deletions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363194)
