Pages that link to "Item:Q4575674"
From MaRDI portal
The following pages link to Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams (Q4575674):
Displayed 28 items.
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- 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)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- An estimator for matching size in low arboricity graphs with two applications (Q2106871) (← links)
- Multistage vertex cover (Q2135630) (← links)
- Streaming deletion problems parameterized by vertex cover (Q2140522) (← links)
- Stochastic packing integer programs with few queries (Q2191766) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
- Graph sketching and streaming: new approaches for analyzing massive graphs (Q2399360) (← links)
- Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791) (← 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)
- (Q5090980) (← links)
- (Q5091015) (← links)
- Optimality of linear sketching under modular updates (Q5091764) (← links)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- (Q5240429) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
- Almost optimal query algorithm for hitting set using a subset query (Q6113278) (← links)
- Space limited graph algorithms on big data (Q6113850) (← links)
- Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model (Q6130326) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
- Space limited linear-time graph algorithms on big data (Q6196840) (← links)