scientific article; zbMATH DE number 2119719
From MaRDI portal
Recommendations
Cited in
(42)- New results for finding common neighborhoods in massive graphs in the data stream model
- On triangle estimation using tripartite independent set queries
- Approximate set union via approximate randomization
- Approximate set union via approximate randomization
- Depth First Search in the Semi-streaming Model
- On graph problems in a semi-streaming model
- A second look at counting triangles in graph streams (corrected)
- Counting Triangles under Updates in Worst-Case Optimal Time
- Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
- Adapting parallel algorithms to the W-stream model, with applications to graph problems
- Cardinality estimation using Gumbel distribution
- Distinct elements in streams: an algorithm for the (text) book
- Counting simplices in hypergraph streams
- Brief announcement: improved massively parallel triangle counting in O(1) rounds
- Optimal sampling from sliding windows
- scientific article; zbMATH DE number 7650137 (Why is no real title available?)
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Approximately counting triangles in sublinear time
- New bounds for the CLIQUE-GAP problem using graph decomposition theory
- scientific article; zbMATH DE number 7758324 (Why is no real title available?)
- Drawing trees in a streaming model
- Structural results on matching estimation with applications to streaming
- Efficient optimally lazy algorithms for minimal-interval semantics
- Towards optimal dynamic indexes for approximate (and exact) triangle counting
- How to catch \(L_2\)-heavy-hitters on sliding windows
- Non-mergeable sketching for cardinality estimation
- Finding articulation points of large graphs in linear time
- scientific article; zbMATH DE number 6862103 (Why is no real title available?)
- Colorful triangle counting and a \textsc{MapReduce} implementation
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
- Efficient transformations for Klee's measure problem in the streaming model
- Clique counting in MapReduce: algorithms and experiments
- Two improved range-efficient algorithms for \(F_0\) estimation
- Polynomial pass semi-streaming lower bounds for k-cores and degeneracy
- Mean and covariance estimation of functional data streams
- A second look at counting triangles in graph streams
- Intractability of min- and max-cut in streaming graphs
- Fast approximate counting of cycles
- Model counting meets \(F_0\) estimation
- Disjunctive complexity
- New bounds for the CLIQUE-GAP problem using graph decomposition theory
- Sublinear-time algorithms for counting star subgraphs via edge sampling
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828992)
