Pages that link to "Item:Q5240429"
From MaRDI portal
The following pages link to A simple, space-efficient, streaming algorithm for matchings in low arboricity graphs (Q5240429):
Displaying 13 items.
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Fixed parameter tractability of graph deletion problems over data streams (Q2019516) (← links)
- Almost-smooth histograms and sliding-window graph algorithms (Q2088588) (← links)
- An estimator for matching size in low arboricity graphs with two applications (Q2106871) (← links)
- Planar Matching in Streams Revisited (Q4636449) (← links)
- A simple augmentation method for matchings with applications to streaming algorithms (Q5005178) (← links)
- Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond (Q5363103) (← links)
- Approximating matching size from random streams (Q5384016) (← links)
- (Q5874443) (← links)
- (Q6084359) (← links)
- Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model (Q6130326) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
- Improved bounds for matching in random-order streams (Q6614611) (← links)
