Dynamic graph stream algorithms in \(o(n)\) space (Q1741857): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-018-0520-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2964299325
@@ Property / OpenAlex ID: W2964299325 / rank @@
+Normal rank
@@ Property / cites work @@
+Correlation clustering in data streams
@@ Property / cites work: Correlation clustering in data streams / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743413
@@ Property / cites work: Q5743413 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228450
@@ Property / cites work: Q4228450 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model
+Normal rank
@@ Property / cites work @@
+Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
+Normal rank
@@ Property / cites work @@
+Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum Spanning Tree Weight in Sublinear Time
+Normal rank
@@ Property / cites work @@
+Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
+Normal rank
@@ Property / cites work @@
+Parameterized Streaming: Maximal Matching and Vertex Cover
+Normal rank
@@ Property / cites work @@
+Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
+Normal rank
@@ Property / cites work @@
+Planar Graphs: Random Walks and Bipartiteness Testing
+Normal rank
@@ Property / cites work @@
+Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
+Normal rank
@@ Property / cites work @@
+Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond
+Normal rank
@@ Property / cites work @@
+Streaming Kernelization
@@ Property / cites work: Streaming Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+On graph problems in a semi-streaming model
@@ Property / cites work: On graph problems in a semi-streaming model / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Distances in the Data-Stream Model
@@ Property / cites work: Graph Distances in the Data-Stream Model / rank @@
+Normal rank
@@ Property / cites work @@
+Sampling in dynamic data streams and applications
@@ Property / cites work: Sampling in dynamic data streams and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to Testing Graph Properties
@@ Property / cites work: Introduction to Testing Graph Properties / rank @@
+Normal rank
@@ Property / cites work @@
+Property testing and its connection to learning and approximation
+Normal rank
@@ Property / cites work @@
+Property testing in bounded degree graphs
@@ Property / cites work: Property testing in bounded degree graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945538
@@ Property / cites work: Q4945538 / rank @@
+Normal rank
@@ Property / cites work @@
+An estimator for matching size in low arboricity graphs with two applications
+Normal rank
@@ Property / cites work @@
+Approximating matching size from random streams
@@ Property / cites work: Approximating matching size from random streams / rank @@
+Normal rank
@@ Property / cites work @@
+Streaming Lower Bounds for Approximating MAX-CUT
@@ Property / cites work: Streaming Lower Bounds for Approximating MAX-CUT / rank @@
+Normal rank
@@ Property / cites work @@
+Single Pass Spectral Sparsification in Dynamic Streams
+Normal rank
@@ Property / cites work @@
+Spanners and sparsifiers in dynamic streams
@@ Property / cites work: Spanners and sparsifiers in dynamic streams / rank @@
+Normal rank
@@ Property / cites work @@
+Sketching Cuts in Graphs and Hypergraphs
@@ Property / cites work: Sketching Cuts in Graphs and Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum Matching in Turnstile Streams
@@ Property / cites work: Maximum Matching in Turnstile Streams / rank @@
+Normal rank
@@ Property / cites work @@
+Densest Subgraph in Dynamic Graph Streams
@@ Property / cites work: Densest Subgraph in Dynamic Graph Streams / rank @@
+Normal rank
@@ Property / cites work @@
+Q3425115
@@ Property / cites work: Q3425115 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing Eulerianity and connectivity in directed sparse graphs
+Normal rank
@@ Property / cites work @@
+Testing the diameter of graphs
@@ Property / cites work: Testing the diameter of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4608052
@@ Property / cites work: Q4608052 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Sketches for the Set Query Problem
@@ Property / cites work: Efficient Sketches for the Set Query Problem / rank @@
+Normal rank
@@ Property / cites work @@
+lgorithmic and Analysis Techniques in Property Testing
+Normal rank
@@ Property / cites work @@
+Sublinear Time Algorithms
@@ Property / cites work: Sublinear Time Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Bounds for Graph Problems in Insertion Streams
+Normal rank
@@ Property / cites work @@
+Q5365017
@@ Property / cites work: Q5365017 / rank @@
+Normal rank
@@ Property / cites work @@
+Property Testing on k-Vertex-Connectivity of Graphs
+Normal rank