Publication:4828992
From MaRDI portal
zbMath1094.68601MaRDI QIDQ4828992
D. Sivakumar, Ziv Bar-Yossef, Ravi Kumar
Publication date: 29 November 2004
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On triangle estimation using tripartite independent set queries, Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components, Finding Articulation Points of Large Graphs in Linear Time, Efficient optimally lazy algorithms for minimal-interval semantics, A second look at counting triangles in graph streams (corrected), New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory, Approximately Counting Triangles in Sublinear Time, Adapting parallel algorithms to the W-stream model, with applications to graph problems, Colorful triangle counting and a \textsc{MapReduce} implementation, Optimal sampling from sliding windows, Unnamed Item, Intractability of min- and max-cut in streaming graphs, Efficient transformations for Klee's measure problem in the streaming model, Drawing trees in a streaming model, New bounds for the CLIQUE-GAP problem using graph decomposition theory, Sublinear-time algorithms for counting star subgraphs via edge sampling, Unnamed Item, New results for finding common neighborhoods in massive graphs in the data stream model, Main-memory triangle computations for very large (sparse (power-law)) graphs, Structural results on matching estimation with applications to streaming, Parameterized aspects of triangle enumeration, Approximate set union via approximate randomization, Approximate set union via approximate randomization, Two improved range-efficient algorithms for \(F_0\) estimation, A second look at counting triangles in graph streams, How to catch \(L_2\)-heavy-hitters on sliding windows, Depth First Search in the Semi-streaming Model, A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling, Counting Triangles under Updates in Worst-Case Optimal Time, Clique Counting in MapReduce, On graph problems in a semi-streaming model
