Pages that link to "Item:Q2941505"
From MaRDI portal
The following pages link to Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams (Q2941505):
Displaying 8 items.
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Finding lasting dense subgraphs (Q2218373) (← links)
- Finding densest \(k\)-connected subgraphs (Q2235249) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
- Graph sketching and streaming: new approaches for analyzing massive graphs (Q2399360) (← links)
- Finding dense subgraphs with maximum weighted triangle density (Q2666852) (← links)
- Optimality of linear sketching under modular updates (Q5091764) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
