Graph Distances in the Data-Stream Model
From MaRDI portal
Recommendations
- Graph distances in the streaming model: the value of space
- Distance distributions for graphs modeling computer networks
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Distanced graphs
- Distance in graphs
- scientific article; zbMATH DE number 194437
- Distance labellings of graphs
- On distance between graphs
- Graph Sparsification in the Semi-streaming Model
Cited in
(29)- New results for finding common neighborhoods in massive graphs in the data stream model
- A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
- Linear programming in the semi-streaming model with application to the maximum matching problem
- Online spanners in metric spaces
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring
- scientific article; zbMATH DE number 7650137 (Why is no real title available?)
- Trading off space for passes in graph streaming problems
- Tight bounds for graph problems in insertion streams
- Dynamic graph stream algorithms in \(o(n)\) space
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index
- scientific article; zbMATH DE number 7758324 (Why is no real title available?)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
- A (3+)-approximate correlation clustering algorithm in dynamic streams
- scientific article; zbMATH DE number 7053292 (Why is no real title available?)
- Semi-online models for cardinality constrained bin packing
- Parameterized complexity of streaming diameter and connectivity problems
- Streaming algorithms for independent sets in sparse hypergraphs
- Near-optimal two-pass streaming algorithm for sampling random walks over directed graphs
- Finding articulation points of large graphs in linear time
- scientific article; zbMATH DE number 7053290 (Why is no real title available?)
- Online Spanners in Metric Spaces
- Superlinear lower bounds for multipass graph processing
- Graph distances in the streaming model: the value of space
- Streaming algorithms for connectivity augmentation
- On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling
- (Noisy) gap cycle counting strikes back: random order streaming lower bounds for connected components and beyond
- Optimal per-edge processing times in the semi-streaming model
- Improved approximation for the directed spanner problem
- Parameterized complexity of streaming diameter and connectivity problems
This page was built for publication: Graph Distances in the Data-Stream Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3642861)
