DOULION
From MaRDI portal
Software:41906
swMATH30192MaRDI QIDQ41906FDOQ41906
Author name not available (Why is that?)
Cited In (12)
- A second look at counting triangles in graph streams (corrected)
- Concentration and moment inequalities for polynomials of independent random variables
- FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams
- Triangle sparsifiers
- An efficient exact algorithm for triangle listing in large graphs
- Approximately counting triangles in sublinear time
- Engineering a delegatable and error-tolerant algorithm for counting small subgraphs
- Efficient computation of the Weighted Clustering Coefficient
- Triangle counting in dynamic graph streams
- Colorful triangle counting and a \textsc{MapReduce} implementation
- A second look at counting triangles in graph streams
- On approximating the number of \(k\)-cliques in sublinear time
This page was built for software: DOULION
