Pages that link to "Item:Q5363104"
From MaRDI portal
The following pages link to Parameterized Streaming: Maximal Matching and Vertex Cover (Q5363104):
Displaying 14 items.
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Fixed parameter tractability of graph deletion problems over data streams (Q2019516) (← 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)
- Streaming deletion problems parameterized by vertex cover (Q2140522) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Brief Announcement: MapReduce Algorithms for Massive Trees (Q5002852) (← links)
- Optimality of linear sketching under modular updates (Q5091764) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← 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)
- Parameterized complexity of streaming diameter and connectivity problems (Q6614110) (← links)
- Improved bounds for matching in random-order streams (Q6614611) (← links)
