Approximate Maximum Matching in Random Streams
From MaRDI portal
Recommendations
- Approximating matching size from random streams
- Maximum matching in semi-streaming with few passes
- Maximum matching in turnstile streams
- Better bounds for matchings in the streaming model
- On estimating maximum matching size in graph streams
- scientific article; zbMATH DE number 6678937
- The streaming \(k\)-mismatch problem
- Deterministic algorithms for maximum matching on general graphs in the semi-streaming model
- Parameterized Streaming: Maximal Matching and Vertex Cover
- scientific article; zbMATH DE number 7768364
Cited in
(16)- Optimal lower bounds for matching and vertex cover in dynamic graph streams
- Maximum weight b-matchings in random-order streams
- scientific article; zbMATH DE number 7758324 (Why is no real title available?)
- Improved bounds for matching in random-order streams
- Improved bounds for matching in random-order streams
- Constructing large matchings via query access to a maximal matching oracle
- Beating two-thirds for random-order streaming matching
- Robust algorithms under adversarial injections
- scientific article; zbMATH DE number 5182608 (Why is no real title available?)
- scientific article; zbMATH DE number 7758318 (Why is no real title available?)
- scientific article; zbMATH DE number 7651106 (Why is no real title available?)
- On regularity lemma and barriers in streaming and dynamic matching
- Markovian online matching algorithms on large bipartite random graphs
- scientific article; zbMATH DE number 6678937 (Why is no real title available?)
- Weighted matching in the random-order streaming and robust communication models
- Parameterized Streaming: Maximal Matching and Vertex Cover
This page was built for publication: Approximate Maximum Matching in Random Streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146889)
