Pages that link to "Item:Q5363103"
From MaRDI portal
The following pages link to Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond (Q5363103):
Displaying 13 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)
- Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791) (← links)
- Maximum Matching in Turnstile Streams (Q3452845) (← links)
- Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams (Q5002618) (← links)
- Brief Announcement: MapReduce Algorithms for Massive Trees (Q5002852) (← links)
- A simple augmentation method for matchings with applications to streaming algorithms (Q5005178) (← links)
- (Q5090980) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- (Q5240429) (← links)
- Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs (Q6179417) (← links)
- A Hall-type theorem with algorithmic consequences in planar graphs (Q6197750) (← links)