Pages that link to "Item:Q1874417"
From MaRDI portal
The following pages link to On finding common neighborhoods in massive graphs. (Q1874417):
Displaying 5 items.
- New results for finding common neighborhoods in massive graphs in the data stream model (Q955006) (← links)
- Intractability of min- and max-cut in streaming graphs (Q1944060) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- On graph problems in a semi-streaming model (Q2581265) (← links)
- Depth First Search in the Semi-streaming Model (Q5090492) (← links)
