Pages that link to "Item:Q4636449"
From MaRDI portal
The following pages link to Planar Matching in Streams Revisited (Q4636449):
Displaying 11 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)
- Graph sketching and streaming: new approaches for analyzing massive graphs (Q2399360) (← links)
- Planarizing Gadgets for Perfect Matching Do Not Exist (Q2912747) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- A simple, space-efficient, streaming algorithm for matchings in low arboricity graphs (Q5240429) (← 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)