The following pages link to (Q5240429):
Displaying 8 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)
- A simple augmentation method for matchings with applications to streaming algorithms (Q5005178) (← 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)
