Optimal per-edge processing times in the semi-streaming model (Q2380006): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1988627162
@@ Property / OpenAlex ID: W1988627162 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4284
@@ Property / arXiv ID: 0708.4284 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198785
@@ Property / cites work: Q4198785 / rank @@
+Normal rank
@@ Property / cites work @@
+A minimum spanning tree algorithm with inverse-Ackermann type complexity
+Normal rank
@@ Property / cites work @@
+Sparsification—a technique for speeding up dynamic graph algorithms
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921736
@@ Property / cites work: Q2921736 / rank @@
+Normal rank
@@ Property / cites work @@
+A matroid approach to finding edge connectivity and packing arborescences
+Normal rank
@@ Property / cites work @@
+Using expander graphs to find vertex connectivity
@@ Property / cites work: Using expander graphs to find vertex connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Q3425115
@@ Property / cites work: Q3425115 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+An optimal minimum spanning tree algorithm
@@ Property / cites work: An optimal minimum spanning tree algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted Matching in the Semi-Streaming Model
@@ Property / cites work: Weighted Matching in the Semi-Streaming Model / rank @@
+Normal rank