Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Handjani, Shirin"'
Suppose we wish to estimate $\#H$, the number of copies of some small graph $H$ in a large streaming graph $G$. There are many algorithms for this task when $H$ is a triangle, but just a few that apply to arbitrary $H$. Here we focus on one such algo
Externí odkaz:
http://arxiv.org/abs/2302.12210
Autor:
Handjani, Shirin J.
Publikováno v:
The Annals of Probability, 1999 Jan 01. 27(1), 226-245.
Externí odkaz:
https://www.jstor.org/stable/2652873
Publikováno v:
Annals of Combinatorics. 2003, Vol. 7 Issue 2, p141-153. 13p.
Autor:
Handjani, Shirin J. *
Publikováno v:
In Stochastic Processes and their Applications 1999 81(1):73-79
Autor:
Handjani, Shirin
Publikováno v:
Journal of Theoretical Probability; Apr2003, Vol. 16 Issue 2, p325-338, 14p
Autor:
Handjani, Shirin J.
Publikováno v:
Journal of Theoretical Probability; Jul97, Vol. 10 Issue 3, p737, 10p
Autor:
Handjani, Shirin, Jungreis, Douglas
Publikováno v:
Journal of Theoretical Probability; Oct96, Vol. 9 Issue 4, p982, 11p
Autor:
Handjani, Shirin
Publikováno v:
Journal of Statistical Physics; September 1995, Vol. 80 Issue: 5-6 p1119-1164, 46p