Pages that link to "Item:Q329293"
From MaRDI portal
The following pages link to Streaming algorithms for independent sets in sparse hypergraphs (Q329293):
Displaying 5 items.
- Computing large independent sets in a single round (Q1699422) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481) (← links)
- Simple and local independent set approximation (Q5919021) (← links)
- Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs (Q6179417) (← links)