Pages that link to "Item:Q963343"
From MaRDI portal
The following pages link to Streaming algorithm for graph spanners-single pass and constant processing time per edge (Q963343):
Displayed 5 items.
- Efficient distributed computation of distance sketches in networks (Q748116) (← links)
- Intractability of min- and max-cut in streaming graphs (Q1944060) (← links)
- COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING (Q3084692) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)