Q5090492 (Q5090492): Difference between revisions

@@ Property / cites work @@
+Linear programming in the semi-streaming model with application to the maximum matching problem
+Normal rank
@@ Property / cites work @@
+The space complexity of approximating the frequency moments
+Normal rank
@@ Property / cites work @@
+Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components
+Normal rank
@@ Property / cites work @@
+Q4828992
@@ Property / cites work: Q4828992 / rank @@
+Normal rank
@@ Property / cites work @@
+Streaming algorithm for graph spanners-single pass and constant processing time per edge
+Normal rank
@@ Property / cites work @@
+Dynamic DFS in Undirected Graphs: breaking the O(<i>m</i>) barrier
+Normal rank
@@ Property / cites work @@
+Incremental algorithm for maintaining a DFS tree for undirected graphs
+Normal rank
@@ Property / cites work @@
+On finding common neighborhoods in massive graphs.
+Normal rank
@@ Property / cites work @@
+Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
+Normal rank
@@ Property / cites work @@
+Distributed exact shortest paths in sublinear time
+Normal rank
@@ Property / cites work @@
+Network Flow and Testing Graph Connectivity
@@ Property / cites work: Network Flow and Testing Graph Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Articulation Points of Large Graphs in Linear Time
+Normal rank
@@ Property / cites work @@
+Q2921736
@@ Property / cites work: Q2921736 / 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 @@
+An Approximate <i>L</i><sup>1</sup> -Difference Algorithm for Massive Data Streams
+Normal rank
@@ Property / cites work @@
+Probabilistic counting algorithms for data base applications
+Normal rank
@@ Property / cites work @@
+Data-streams and histograms
@@ Property / cites work: Data-streams and histograms / rank @@
+Normal rank
@@ Property / cites work @@
+Superlinear lower bounds for multipass graph processing
+Normal rank
@@ Property / cites work @@
+Q4945538
@@ Property / cites work: Q4945538 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Stable distributions, pseudorandom generators, embeddings, and data stream computation
+Normal rank
@@ Property / cites work @@
+Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams
+Normal rank
@@ Property / cites work @@
+Better bounds for matchings in the streaming model
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Q3425115
@@ Property / cites work: Q3425115 / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey of Graph Algorithms Under Extended Streaming Models of Computation
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Dominators in Directed Graphs
@@ Property / cites work: Finding Dominators in Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+Edge-disjoint spanning trees and depth-first search
+Normal rank
@@ Property / cites work @@
+Worst-case Analysis of Set Union Algorithms
@@ Property / cites work: Worst-case Analysis of Set Union Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Maintaining bridge-connected and biconnected components on-line
+Normal rank