The following pages link to (Q4828992):
Displaying 32 items.
- Efficient optimally lazy algorithms for minimal-interval semantics (Q313957) (← links)
- Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)
- Colorful triangle counting and a \textsc{MapReduce} implementation (Q413300) (← links)
- Optimal sampling from sliding windows (Q414877) (← links)
- Drawing trees in a streaming model (Q436551) (← links)
- A second look at counting triangles in graph streams (Q740973) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- On triangle estimation using tripartite independent set queries (Q825973) (← links)
- Efficient transformations for Klee's measure problem in the streaming model (Q904110) (← links)
- New results for finding common neighborhoods in massive graphs in the data stream model (Q955006) (← links)
- Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020) (← links)
- Two improved range-efficient algorithms for \(F_0\) estimation (Q1007249) (← links)
- New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Intractability of min- and max-cut in streaming graphs (Q1944060) (← links)
- A second look at counting triangles in graph streams (corrected) (Q2397608) (← links)
- On graph problems in a semi-streaming model (Q2581265) (← links)
- Clique Counting in MapReduce (Q2828209) (← links)
- Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components (Q2894245) (← links)
- New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory (Q2946384) (← links)
- Finding Articulation Points of Large Graphs in Linear Time (Q3449834) (← links)
- Approximately Counting Triangles in Sublinear Time (Q4593251) (← links)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
- Depth First Search in the Semi-streaming Model (Q5090492) (← links)
- Counting Triangles under Updates in Worst-Case Optimal Time (Q5091114) (← links)
- (Q5875530) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- Approximate set union via approximate randomization (Q5918258) (← links)
- Approximate set union via approximate randomization (Q5919116) (← links)
- (Q6062143) (← links)
- Model counting meets \(F_0\) estimation (Q6535267) (← links)
