Pages that link to "Item:Q3642861"
From MaRDI portal
The following pages link to Graph Distances in the Data-Stream Model (Q3642861):
Displaying 14 items.
- Streaming algorithms for independent sets in sparse hypergraphs (Q329293) (← links)
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling (Q2066591) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem (Q3012945) (← links)
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index (Q3088117) (← links)
- Finding Articulation Points of Large Graphs in Linear Time (Q3449834) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- (Q5743413) (← links)
- (Q5875530) (← links)
- (Q6062143) (← links)
- Online Spanners in Metric Spaces (Q6195959) (← links)
