Pages that link to "Item:Q4629961"
From MaRDI portal
The following pages link to Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond (Q4629961):
Displaying 11 items.
- Fixed parameter tractability of graph deletion problems over data streams (Q2019516) (← links)
- Almost-smooth histograms and sliding-window graph algorithms (Q2088588) (← links)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams (Q4575674) (← links)
- Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond (Q5363103) (← links)
- Parameterized Streaming: Maximal Matching and Vertex Cover (Q5363104) (← 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)