DOULION
From MaRDI portal
Cited in
(13)- An efficient exact algorithm for triangle listing in large graphs
- FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams
- A second look at counting triangles in graph streams (corrected)
- Triangle sparsifiers
- 5tbl
- Colorful triangle counting and a \textsc{MapReduce} implementation
- six-subgraph
- Approximately counting triangles in sublinear time
- On approximating the number of k-cliques in sublinear time
- Engineering a delegatable and error-tolerant algorithm for counting small subgraphs
- Concentration and moment inequalities for polynomials of independent random variables
- Efficient computation of the Weighted Clustering Coefficient
- A second look at counting triangles in graph streams
This page was built for software: DOULION
