Pages that link to "Item:Q5384016"
From MaRDI portal
The following pages link to Approximating matching size from random streams (Q5384016):
Displaying 18 items.
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- An estimator for matching size in low arboricity graphs with two applications (Q2106871) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem (Q4997308) (← links)
- Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams (Q5002618) (← links)
- Sublinear Algorithms for MAXCUT and Correlation Clustering (Q5002682) (← links)
- A simple augmentation method for matchings with applications to streaming algorithms (Q5005178) (← links)
- (Q5090980) (← links)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Approximate Maximum Matching in Random Streams (Q5146889) (← links)
- A simple, space-efficient, streaming algorithm for matchings in low arboricity graphs (Q5240429) (← links)
- (Q6084359) (← links)
- Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model (Q6130326) (← links)
- Delay epidemic models determined by latency, infection, and immunity duration (Q6550770) (← links)
- Improved bounds for matching in random-order streams (Q6614611) (← links)
