The following pages link to Computing and Combinatorics (Q5716993):
Displaying 17 items.
- Triangle counting in dynamic graph streams (Q334947) (← links)
- Colorful triangle counting and a \textsc{MapReduce} implementation (Q413300) (← links)
- Optimal sampling from sliding windows (Q414877) (← links)
- A second look at counting triangles in graph streams (Q740973) (← links)
- On triangle estimation using tripartite independent set queries (Q825973) (← links)
- Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020) (← links)
- New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587) (← links)
- Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model (Q1741393) (← links)
- Intractability of min- and max-cut in streaming graphs (Q1944060) (← links)
- A second look at counting triangles in graph streams (corrected) (Q2397608) (← links)
- Clique Counting in MapReduce (Q2828209) (← links)
- New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory (Q2946384) (← links)
- Approximately Counting Triangles in Sublinear Time (Q4593251) (← links)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
- Counting Triangles under Updates in Worst-Case Optimal Time (Q5091114) (← links)
- On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) (← links)
- (Q6062143) (← links)