DOULION
From MaRDI portal
Software:41906
swMATH30192MaRDI QIDQ41906FDOQ41906
Author name not available (Why is that?)
Cited In (12)
- Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs
- A second look at counting triangles in graph streams (corrected)
- FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams
- Triangle sparsifiers
- An efficient exact algorithm for triangle listing in large graphs
- On Approximating the Number of $k$-Cliques in Sublinear Time
- 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
- Approximately Counting Triangles in Sublinear Time
- Concentration and Moment Inequalities for Polynomials of Independent Random Variables
This page was built for software: DOULION
